Related papers: Local Kesten--McKay law for random regular graphs
An invariant random subgroup of the countable group {\Gamma} is a random subgroup of {\Gamma} whose distribution is invariant under conjugation by all elements of {\Gamma}. We prove that for a nonamenable invariant random subgroup H, the…
We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both…
We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schr\"odinger operators in a very general setting. We consider a sequence of finite graphs endowed with discrete Schr\"odinger operators, assumed to have a local…
We study the universality of spectral statistics of large random matrices. We consider $N\times N$ symmetric, hermitian or quaternion self-dual random matrices with independent, identically distributed entries (Wigner matrices) where the…
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…
Random graph models are used to describe the complex structure of real-world networks in diverse fields of knowledge. Studying their behavior and fitting properties are still critical challenges, that in general, require model specific…
A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
Similarity metrics are central in the theory of large networks and graph limits. For bounded-degree graphs, the Benjamini--Schramm metric records the distribution of rooted neighbourhoods, while the stronger colored-neighbourhood metric…
We analyse the eigenvectors of the adjacency matrix of a random inhomogeneous graph constructed from a specified degree sequence. We assume that the empirical degree sequence has bounded mean and variance. We show that near the edges of the…
We show that the largest density of factor of i.i.d. independent sets on the d-regular tree is asymptotically at most (log d)/d as d tends to infinity. This matches the lower bound given by previous constructions. It follows that the…
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…
Let $G$ be a connected graph in which almost all vertices have linear degrees and let $T$ be a uniform spanning tree of $G$. For any fixed rooted tree $F$ of height $r$ we compute the asymptotic density of vertices $v$ for which the…
We study random k-lifts of large, but otherwise arbitrary graphs G. We prove that, with high probability, all eigenvalues of the adjacency matrix of the lift that are not eigenvalues of G are of the order (D ln (kn))^{1/2}, where D is the…
The spectral functions are studied in conjunction with the dyadic Green's functions for various media. The dyadic Green's functions are found using the eigenfunction expansion method for homogeneous, inhomogeneous, periodic, lossless,…
We show that for any infinite tree of finite cone type satisfying a mild expansion condition, the only typical process on its vertices with covariance induced by the Green's function is the Gaussian wave. This generalizes a result of…
We consider the bulk eigenvalue statistics of Laplacian matrices of large Erd\H{o}s-R\'enyi random graphs in the regime $p \geq N^{\delta}/N$ for any fixed $\delta >0$. We prove a local law down to the optimal scale $\eta \gtrsim N^{-1}$…
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…
The exact reduced density-matrix functional is derived from the Luttinger-Ward functional of the single-particle Green's function. Thereby, a formal link is provided between diagrammatic many-body approaches using Green's functions on the…
The statistics of random band--matrices with width and strength of the band slowly varying along the diagonal is considered. The Dyson equation for the averaged Green function close to the edge of spectrum is reduced to the Painlev\'{e} I…