相关论文: The Canopy Graph and Level Statistics for Random O…

In this paper we study spectral properties of self-adjoint operators on a large class of geometries given via sofic groups. We prove that the associated integrated densities of states can be approximated via finite volume analogues. This is…

Parameter-dependent statistical properties of spectra of totally connected irregular quantum graphs with Neumann boundary conditions are studied. The autocorrelation functions of level velocities c(x) and c(w,x) as well as the distributions…

We study notions of hyperuniformity for invariant locally square-integrable point processes in regular trees. We show that such point processes are never geometrically hyperuniform, and if the diffraction measure has support in the…

Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…

The work presents a proof of convergence of the density of energy levels to a Gaussian distribution for a wide class of quadratic forms of Fermi operators. This general result applies also to quadratic operators with disorder, e.g.,…

Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…

The spectrum of the self-adjoint Schr\"odinger operator associated with the Kronig-Penney model on the half-line has a band-gap structure: its absolutely continuous spectrum consists of intervals (bands) separated by gaps. We show that if…

R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar, binary trees with $2n+1$ vertices. We obtain a…

We consider a Schroedinger operator with random potential distributed according to a Poisson process. We show that expectations of matrix elements of the resolvent as well as the density of states can be approximated to arbitrary precision…

In 1989, Zehavi and Itai conjectured that every $k$-connected graph contains $k$ independent spanning trees rooted at any prescribed vertex $r$. That is, for each vertex $v$, the unique $r$-$v$ paths within these $k$ spanning trees are…

We consider a sequence of finite quantum graphs with few loops, so that they converge, in the sense of Benjamini-Schramm, to a random infinite quantum tree. We assume these quantum trees are spectrally delocalized in some interval $I$, in…

We prove that a zero topological entropy continuous tree map always displays zero topological sequence entropy when it is restricted to its non-wandering and chain recurrent sets. In addition, we show that a similar result is not possible…

It is known that the essential spectrum of a Schr\"odinger operator $H$ on $\ell^{2}\left(\mathbb{N}\right)$ is equal to the union of the spectra of right limits of $H$. The natural generalization of this relation to $\mathbb{Z}^{n}$ is…

The theory of random sets is demonstrated to prove useful for the theory of random operators. A random operator is here defined by requiring the graph to be a random set. It is proved that the spectrum and the set of eigenvalues of random…

We are interested in the nature of the spectrum of the one-dimensional Schr\"odinger operator $$ - \frac{d^2}{dx^2}-Fx + \sum_{n \in \mathbb{Z}}g_n \delta(x-n) \qquad\text{in } L^2(\mathbb{R}) $$ with $F>0$ and two different choices of the…

We consider matrices on infinite trees which are universal covers of Jacobi matrices on finite graphs. We are interested in the question of the existence of sequences of finite covers whose normalized eigenvalue counting measures converge…

We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…

For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that…

We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…

We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…