Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues
نویسندگان
چکیده
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertices where every edge is chosen independently and with probability p ≡ p(N). We rescale the matrix so that its bulk eigenvalues are of order one. Under the assumption pN N, we prove the universality of eigenvalue distributions both in the bulk and at the edge of the spectrum. More precisely, we prove (1) that the eigenvalue spacing of the Erdős-Rényi graph in the bulk of the spectrum has the same distribution as that of the Gaussian orthogonal ensemble; and (2) that the second largest eigenvalue of the Erdős-Rényi graph has the same distribution as the largest eigenvalue of the Gaussian orthogonal ensemble. As an application of our method, we prove the bulk universality of generalized Wigner matrices under the assumption that the matrix entries have at least 4 + ε moments.
منابع مشابه
Spectral Statistics of Erdős-Rényi Graphs I: Local Semicircle Law
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertices where every edge is chosen independently and with probability p ≡ p(N). We rescale the matrix so that its bulk eigenvalues are of order one. We prove that, as long as pN →∞ (with a speed at least logarithmic in N), the density of eigenvalues of the Erdős-Rényi ensemble is given by the Wigner s...
متن کاملOn Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs
Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...
متن کاملLifshits Tails for Spectra of Erdős-rényi Random Graphs by Oleksiy Khorunzhiy
We consider the discrete Laplace operator ∆ on Erdős–Rényi random graphs with N vertices and edge probability p/N . We are interested in the limiting spectral properties of ∆ as N → ∞ in the subcritical regime 0 < p < 1 where no giant cluster emerges. We prove that in this limit the expectation value of the integrated density of states of ∆ exhibits a Lifshits-tail behaviour at the lower spectr...
متن کاملLifshits Tails for Spectra of Erdős-rényi Random Graphs
We consider the discrete Laplace operator ∆ on Erdős–Rényi random graphs with N vertices and edge probability p/N . We are interested in the limiting spectral properties of ∆ as N → ∞ in the subcritical regime 0 < p < 1 where no giant cluster emerges. We prove that in this limit the expectation value of the integrated density of states of ∆ exhibits a Lifshits-tail behaviour at the lower spectr...
متن کاملLifshitz Tails for Spectra of Erdős–rényi Random Graphs
We consider the discrete Laplace operator ∆ on Erdős–Rényi random graphs with N vertices and edge probability p/N . We are interested in the limiting spectral properties of ∆ as N → ∞ in the subcritical regime 0 < p < 1 where no giant cluster emerges. We prove that in this limit the expectation value of the integrated density of states of ∆ exhibits a Lifshitz-tail behavior at the lower spectra...
متن کامل