Related papers: Absolutely Continuous Spectrum for the Anderson Mo…
In this paper, we study the topological spectrum of weighted Birkhoff averages over aperiodic and irreducible subshifts of finite type. We show that for a uniformly continuous family of potentials, the spectrum is continuous and concave…
We consider discrete Schr\"odinger operators on the half line with potentials generated by the doubling map and continuous sampling functions. We show that the essential spectrum of these operators is always connected. This result is…
We prove that if a unimodular random rooted graph is recurrent, the number of ends of its uniform spanning tree is almost surely equal to the number of ends of the graph. Together with previous results in the transient case, this completely…
The structure of the spectrum of random operators is studied. It is shown that if the density of states measure of some subsets of the spectrum is zero, then these subsets are empty. In particular follows that absolute continuity of the IDS…
We give the first example of a smooth volume preserving mixing dynamical system such that the discrete Schr\"odinger operators on the line defined with a potential generated by this system and a H\"older sampling function, have almost…
For a large class of nonuniformly expanding maps of $\Bbb R^m$, with indifferent fixed points and unbounded distorsion and non necessarily Markovian, we construct an absolutely continuous invariant measure. We extend to our case techniques…
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
We summarize (and comment on) the research program carried out in (CMP 319, 501 (2013)), (CMP 338, 347 (2015)), (CMP 344, 959 (2016), (LMP 106, 787 (2016)). This program is devoted to the characterization of the absolutely continuous…
We prove a sampling theorem for infinite-dimensional Paley-Wiener spaces on graphs which allows for stable frame reconstruction. We prove that all sampling sets for a fixed Paley-Wiener space are complements of lambda-sets (i.e. sets where…
We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v \in V(G)} (d(v)+1)$ spanning trees. This result is tight…
A sufficient criterion for "non-degeneracy" is given for Exponential Random Graph Models on sparse graphs with sufficient statistics which are functions of the degree sequence. This criterion explains why statistics such as alternating…
The strip entropy is studied in this article. We prove that the strip entropy approximation is valid for every ray of a golden-mean tree. This result extends the previous result of [Petersen-Salama, Discrete \& Continuous Dynamical Systems,…
We prove an upper bound for the (differentiated) density of states of the Anderson model at the bottom of the spectrum. The density of states is shown to exhibit the same Lifshitz tails upper bound as the integrated density of states.
We introduce a new $\Phi $-derivable approach for the Anderson impurity model in a BCS superconductor. The regime of validity of this conserving theory extends well beyond that of the Hartree-Fock approximation. This is the first…
We give a common matroidal generalisation of `A Cantor-Bernstein theorem for paths in graphs' by Diestel and Thomassen and `A Cantor-Bernstein-type theorem for spanning trees in infinite graphs' by ourselves.
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
The Spectral Edges Conjecture is a well-known and widely believed conjecture in the theory of discrete periodic operators. It states that the extrema of the dispersion relation are isolated, non-degenerate, and occur in a single band. We…
It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…