English
Related papers

Related papers: Absolutely continuous spectrum for a random potent…

200 papers

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

Logic in Computer Science · Computer Science 2026-04-09 Mikołaj Bojańczyk , Pierre Ohlmann

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…

Spectral Theory · Mathematics 2015-06-15 Rafael del Rio

We consider Schr\"odinger operators with ergodic potential $V_\omega(n)=f(T^n(\omega))$, $n \in \Z$, $\omega \in \Omega$, where $T:\Omega \to \Omega$ is a non-periodic homeomorphism. We show that for generic $f \in C(\Omega)$, the spectrum…

Dynamical Systems · Mathematics 2015-02-24 Artur Avila , David Damanik

We consider the Schr\"odinger operator on nanoribbons (tight-binding models) in an external electric potentials $V$. The corresponding electric field is perpendicular to the axis of the nanoribbon. If V=0, then the spectrum of the…

Spectral Theory · Mathematics 2008-03-20 Evgeny Korotyaev , Anton Kutsenko

We present a result of absence of absolutely continuous spectrum in an interval of $\R$, for a matrix-valued random Schr\"odinger operator, acting on $L^2(\R)\otimes \R^N$ for an arbitrary $N\geq 1$, and whose interaction potential is…

Mathematical Physics · Physics 2010-06-10 Hakim Boumaza

For any multi-graph $G$ with edge weights and vertex potential, and its universal covering tree $\mathcal{T}$, we completely characterize the point spectrum of operators $A_{\mathcal{T}}$ on $\mathcal{T}$ arising as pull-backs of local,…

Spectral Theory · Mathematics 2020-10-01 Jess Banks , Jorge Garza-Vargas , Satyaki Mukherjee

We present and exploit an analogy between lack of absolutely continuous spectrum for Schroedinger operators and natural boundaries for power series. Among our new results are generalizations of Hecke's example and natural boundary examples…

Complex Variables · Mathematics 2010-08-10 Jonathan Breuer , Barry Simon

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…

Dynamical Systems · Mathematics 2019-02-20 Bassam Fayad , Yanhui Qu

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

Mathematical Physics · Physics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…

Combinatorics · Mathematics 2017-12-06 Benedikt Stufler

We consider discrete Schr\"odinger operators with periodic potentials on periodic graphs perturbed by guided non-positive potentials, which are periodic in some directions and finitely supported in other ones. The spectrum of the…

Spectral Theory · Mathematics 2017-05-16 Evgeny Korotyaev , Natalia Saburova

The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…

Combinatorics · Mathematics 2026-01-13 Hyunwoo Lee

We show that discrete one-dimensional Schr\"odinger operators on the half-line with ergodic potentials generated by the doubling map on the circle, $V_\theta(n) = f(2^n \theta)$, may be realized as the half-line restrictions of a…

Mathematical Physics · Physics 2014-12-31 David Damanik , Rowan Killip

We analyze all orthonormal bases of exponentials on the Cantor set defined by Jorgensen and Pedersen in J. Anal. Math. 75,1998, pp 185-228. A complete characterization for all maximal sets of orthogonal exponentials is obtained by…

Functional Analysis · Mathematics 2008-04-30 Dorin Ervin Dutkay , Deguang Han , Qiyu Sun

We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…

Statistical Mechanics · Physics 2007-05-23 T. Antal , P. L. Krapivsky

We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of…

Probability · Mathematics 2022-12-22 Michael Albert , Cecilia Holmgren , Tony Johansson , Fiona Skerman

We consider normalized Laplacians and their perturbations by periodic potentials (Schr\"odinger operators) on periodic discrete graphs. The spectrum of the operators consists of an absolutely continuous part (a union of a finite number of…

Spectral Theory · Mathematics 2020-04-09 E. Korotyaev , N. Saburova

The existence of absolutely continuous (a.c.) spectrum for the discrete Molchanov-Vainberg Schr\"odinger operator $D+V$ on $\ell^2(\mathbb{Z}^d)$, in dimensions $d\geq 2$, is further investigated for potentials $V$ satisfying the long range…

Spectral Theory · Mathematics 2022-01-04 Marc-Adrien Mandich

We consider discrete Schr\"odinger operators with real periodic potentials on periodic graphs. The spectra of the operators consist of a finite number of bands. By "rolling up" a periodic graph along some appropriate directions we obtain…

Spectral Theory · Mathematics 2025-07-22 Natalia Saburova

Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of spanning trees of a graph. We prove that for any bounded-degree n-vertex graph, the union of two random spanning trees…

Discrete Mathematics · Computer Science 2008-07-10 Navin Goyal , Luis Rademacher , Santosh Vempala