Related papers: The Canopy Graph and Level Statistics for Random O…

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…

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…

We study the level statistics (second half moment $I_0$ and rigidity $\Delta_3$) and the eigenfunctions of pseudointegrable systems with rough boundaries of different genus numbers $g$. We find that the levels form energy intervals with a…

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

We consider ergodic random magnetic Schr\"odinger operators on the metric graph $\mathbb{Z}^d$ with random potentials and random boundary conditions taking values in a finite set. We show that normalized finite volume eigenvalue counting…

We give sufficient conditions for the presence of the absolutely continuous spectrum of a Schr\"odinger operator on a regular rooted tree without loops (also called regular Bethe lattice or Cayley tree).

We prove that the spectrum of a limit-periodic Schr\"odinger operator is homogeneous in the sense of Carleson whenever the potential obeys the Pastur--Tkachenko condition. This implies that a dense set of limit-periodic Schr\"odinger…

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

We study a certain class of piecewise monotonic maps of interval. These maps are strictly monotone on finite interval partition, satisfies Markov condition and have generator property. We show that for a function from this class…

We consider the Laplacian on a rooted metric tree graph with branching number $ K \geq 2 $ and random edge lengths given by independent and identically distributed bounded variables. Our main result is the stability of the absolutely…

We prove the almost sure existence of absolutely continuous spectrum at low disorder for the Anderson model on the simplest example of a product of a regular tree with a finite graph. This graph contains loops of unbounded size.

We consider a family of random Schr\"odinger operators on the discrete strip with decaying random $\ell^2$ matrix potential. We prove that the spectrum is almost surely pure absolutely continuous, apart from random, possibly embedded…

We give an overview and extension of recent results on ergodic random Schr\"odinger operators for models on $\mathbb{Z}^d$. The operators we consider are defined on combinatorial or metric graphs, with random potentials, random boundary…

We analyse the spectral phase diagram of Schr\"odinger operators $ T +\lambda V$ on regular tree graphs, with $T$ the graph adjacency operator and $V$ a random potential given by iid random variables. The main result is a criterion for the…

Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…

We show that the local limit of the uniform spanning tree on any finite, simple, connected, regular graph sequence with degree tending to infinity is the Poisson(1) branching process conditioned to survive forever. An extension to "almost"…

The logarithm of the number of Eulerian orientations, normalised by the number of vertices, is known as the residual entropy in studies of ice-type models on graphs. The spanning tree entropy depends similarly on the number of spanning…

Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many…

We study an equilibrium statistical mechanical model of tree graphs which are made up of a linear subgraph (the spine) to which leaves are attached. We prove that the model has two phases, a generic phase where the spine becomes infinitely…