Upward-closed hereditary families in the dominance order

The majorization relation orders the degree sequences of simple graphs into posets called dominance orders. As shown by Hammer et al. and Merris, the degree sequences of threshold and split graphs form upward-closed sets within the dominance orders they belong to, i.e., any degree sequence majorizing a split or threshold sequence must itself be split or threshold, respectively. Motivated by the fact that threshold graphs and split graphs have characterizations in terms of forbidden induced subgraphs, we define a class $\mathcal{F}$ of graphs to be dominance monotone if whenever no realization of $e$ contains an element $\mathcal{F}$ as an induced subgraph, and $d$ majorizes $e$, then no realization of $d$ induces an element of $\mathcal{F}$. We present conditions necessary for a set of graphs to be dominance monotone, and we identify the dominance monotone sets of order at most 3.Comment: 15 pages, 6 figure

Arc-quasianalytic functions

We work with quasianalytic classes of functions. Consider a real-valued function y = f(x) on an open subset U of Euclidean space, which satisfies a quasianalytic equation G(x, y) = 0. We prove that f is arc-quasianalytic (i.e., its restriction to every quasianalytic arc is quasianalytic) if and only if f becomes quasianalytic after (a locally finite covering of U by) finite sequences of local blowing-ups. This generalizes a theorem of the first two authors on arc-analytic functions.Comment: 12 page

Reply to "Comment on `Quenches in quantum many-body systems: One-dimensional Bose-Hubbard model reexamined' ''

In his Comment [see preceding Comment, Phys. Rev. A 82, 037601 (2010)] on the paper by Roux [Phys. Rev. A 79, 021608(R) (2009)], Rigol argued that the energy distribution after a quench is not related to standard statistical ensembles and cannot explain thermalization. The latter is proposed to stem from what he calls the eigenstate thermalization hypothesis and which boils down to the fact that simple observables are expected to be smooth functions of the energy. In this Reply, we show that there is no contradiction or confusion between the observations and discussions of Roux and the expected thermalization scenario discussed by Rigol. In addition, we emphasize a few other important aspects, in particular the definition of temperature and the equivalence of ensemble, which are much more difficult to show numerically even though we believe they are essential to the discussion of thermalization. These remarks could be of interest to people interested in the interpretation of the data obtained on finite-size systems.Comment: 3 page

Two properties of vectors of quadratic forms in Gaussian random variables

We study distributions of random vectors whose components are second order polynomials in Gaussian random variables. Assuming that the law of such a vector is not absolutely continuous with respect to Lebesgue measure, we derive some interesting consequences. Our second result gives a characterization of limits in law for sequences of such vectors.Comment: 14 page

Distance distribution in random graphs and application to networks exploration

We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of determining the proportion of edges connecting nodes that are at identical distance from the source node. The evolution of this quantity with the probability of existence of the edges exhibits intriguing oscillatory behavior. In order to perform our analysis, we introduce a new way of computing the distribution of distances between nodes. Our method outperforms previous similar analyses and leads to estimates that coincide remarkably well with numerical simulations. It allows us to characterize the phase transitions appearing when the connectivity probability varies.Comment: 12 pages, 8 figures (18 .eps files

Euler buckling instability and enhanced current blockade in suspended single-electron transistors

Single-electron transistors embedded in a suspended nanobeam or carbon nanotube may exhibit effects originating from the coupling of the electronic degrees of freedom to the mechanical oscillations of the suspended structure. Here, we investigate theoretically the consequences of a capacitive electromechanical interaction when the supporting beam is brought close to the Euler buckling instability by a lateral compressive strain. Our central result is that the low-bias current blockade, originating from the electromechanical coupling for the classical resonator, is strongly enhanced near the Euler instability. We predict that the bias voltage below which transport is blocked increases by orders of magnitude for typical parameters. This mechanism may make the otherwise elusive classical current blockade experimentally observable.Comment: 15 pages, 10 figures, 1 table; published versio

Large current noise in nanoelectromechanical systems close to continuous mechanical instabilities

We investigate the current noise of nanoelectromechanical systems close to a continuous mechanical instability. In the vicinity of the latter, the vibrational frequency of the nanomechanical system vanishes, rendering the system very sensitive to charge fluctuations and, hence, resulting in very large (super-Poissonian) current noise. Specifically, we consider a suspended single-electron transistor close to the Euler buckling instability. We show that such a system exhibits an exponential enhancement of the current noise when approaching the Euler instability which we explain in terms of telegraph noise.Comment: 11 pages, 12 figures; v2: minor changes, published versio

Fast Decoders for Topological Quantum Codes

We present a family of algorithms, combining real-space renormalization methods and belief propagation, to estimate the free energy of a topologically ordered system in the presence of defects. Such an algorithm is needed to preserve the quantum information stored in the ground space of a topologically ordered system and to decode topological error-correcting codes. For a system of linear size L, our algorithm runs in time log L compared to L^6 needed for the minimum-weight perfect matching algorithm previously used in this context and achieves a higher depolarizing error threshold.Comment: 4 pages, 4 figure