Related papers: Local Kesten--McKay law for random regular graphs
We study the spectra and eigenvectors of the adjacency matrices of scale-free networks when bi-directional interaction is allowed, so that the adjacency matrix is real and symmetric. The spectral density shows an exponential decay around…
The adjacency matrix is the most fundamental and intuitive object in graph analysis that is useful not only mathematically but also for visualizing the structures of graphs. Because the appearance of an adjacency matrix is critically…
Many natural and social systems develop complex networks, that are usually modelled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semi-circle law is known to…
A method of resummation of infinite series of perturbation theory diagrams is applied for studying the properties of random band matrices. The topological classification of Feynman diagrams, which was actively used in last years for matrix…
The delta interaction at a vertex generalizes the Robin (generalized Neumann) boundary condition on an interval. Study of a single vertex with N infinite leads suffices to determine the localized effects of such a vertex on densities of…
Let $G=G(n,p_n)$ be a homogeneous Erd\"os-R\'enyi graph, and $A$ its adjacency matrix with eigenvalues $\lambda_1(A) \geq \lambda_2(A) \geq ... \geq \lambda_n(A).$ Local laws have been used to show that $lambda_2(A)$ can exhibit…
We prove delocalization of eigenvectors of vertex-transitive graphs via elementary estimates of the spectral projector. We recover in this way known results which were formerly proved using representation theory. Similar techniques show…
We consider the local statistics of $H = V^* X V + U^* Y U$ where $V$ and $U$ are independent Haar-distributed unitary matrices, and $X$ and $Y$ are deterministic real diagonal matrices. In the bulk, we prove that the gap statistics and…
We define nearest-neighbour point processes on graphs with Euclidean edges and linear networks. They can be seen as the analogues of renewal processes on the real line. We show that the Delaunay neighbourhood relation on a tree satisfies…
In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_1, G_2, G_3, \ldots$ is a sequence of finite and connected graphs that share a common universal cover $T$ and such that…
Trace formulae for d-regular graphs are derived and used to express the spectral density in terms of the periodic walks on the graphs under consideration. The trace formulae depend on a parameter w which can be tuned continuously to assign…
It was conjectured by Alon and proved by Friedman that a random $d$-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…
We consider the statistics of extreme eigenvalues of random $d$-regular graphs, with $N^{\mathfrak c}\leq d\leq N^{1/3-{\mathfrak c}}$ for arbitrarily small ${\mathfrak c}>0$. We prove that in this regime, the fluctuations of extreme…
One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe the edges of universality by studying the spectral properties of random…
We review the state of the art on the delocalized non-ergodic regime of the Anderson model on Bethe lattices. We also present new results using Belief Propagation, which consists in solving the self-consistent recursion relations for the…
We propose a random graph model with preferential attachment rule and \emph{edge-step functions} that govern the growth rate of the vertex set. We study the effect of these functions on the empirical degree distribution of these random…
We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…
We prove an almost sure central limit theorem on the Poisson space, which is perfectly tailored for stabilizing functionals emerging in stochastic geometry. As a consequence, we provide almost sure central limit theorems for $(i)$ the total…