Related papers: Local law for eigenvalues of random regular bipart…
McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…
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}$…
Using a simple deterministic model for the Internet graph we show that the eigenvalue power law distribution for its adjacency matrix is a direct consequence of the degree distribution and that the graph must contain many star subgraphs.
For random operators it is conjectured that spectral properties of an infinite-volume operator are related to the distribution of spectral gaps of finite-volume approximations. In particular, localization and pure point spectrum in infinite…
We consider large random matrices $X$ with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
We obtain the limiting spectral distribution for large sample covariance matrices associated with random vectors having graph-dependent entries under the assumption that the interdependence among the entries grows with the sample size n.…
We analyze gene co-expression network under the random matrix theory framework. The nearest neighbor spacing distribution of the adjacency matrix of this network follows Gaussian orthogonal statistics of random matrix theory (RMT). Spectral…
We explore the limiting empirical eigenvalue distributions arising from matrices of the form \[A_{n+1} = \begin{bmatrix} A_n & I\\ I & A_n \end{bmatrix} , \]where $A_0$ is the adjacency matrix of a $k$-regular graph. We find that for…
This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has…
We consider the problem of determining the limiting spectral distribution for random matrices whose row distributions are permitted to have limited dependence. We assume mild moment conditions and give an extension of the…
We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of adjacency matrix of various model networks, namely, random,…
In this note, we prove that the normalized trace of the resolvent of the beta-Laguerre ensemble eigenvalues is close to the Stieltjes transform of the Marchenko-Pastur (MP) distribution with very high probability, for values of the…
We compare the spectrum and the localisation properties of the eigenmodes of the Laplacian and the adjacency matrix of 2D random geometric graphs, using numerical diagonalization of these matrices for different system sizes and…
We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…
We perform an extensive investigation of the localization properties of the eigenmodes of the Laplace and adjacency matrix for one-dimensional random geometric graphs. We evaluate the density of states, the probability distribution of the…
We consider extremal eigenvalues of sparse random matrices, a class of random matrices including the adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs $\mathcal{G}(N,p)$. Recently, it was shown that the leading order fluctuations of extremal…
We consider deformed sparse random matrices of the form $H= W+ \lambda V$, where $W$ is a real symmetric sparse random matrix, $V$ is a random or deterministic, real, diagonal matrix whose entries are independent of $W$, and $\lambda = O(1)…
In this paper, we consider the empirical spectral distribution of the sample correlation matrix and investigate its asymptotic behavior under mild assumptions on the data's distribution, when dimension and sample size increase at the same…
It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, we propose a method to obtain all the spectrum, and also the…