Spectral statistics of Erdős-Rényi graphs I: Local semicircle law

preprint2013arXivOpen access

Abstract

We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, that is, graphs on NN vertices where every edge is chosen independently and with probability p≡p(N)p\equiv p(N). We rescale the matrix so that its bulk eigenvalues are of order one. We prove that, as long as pN→∞pN\to\infty (with a speed at least logarithmic in NN), the density of eigenvalues of the Erdős-Rényi ensemble is given by the Wigner semicircle law for spectral windows of length larger than N−1N^{-1} (up to logarithmic corrections). As a consequence, all eigenvectors are proved to be completely delocalized in the sense that the ℓ∞\ell^{\infty}-norms of the ℓ2\ell^2-normalized eigenvectors are at most of order N−1/2N^{-1/2} with a very high probability. The estimates in this paper will be used in the companion paper [Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues (2011) Preprint] to prove the universality of eigenvalue distributions both in the bulk and at the spectral edges under the further restriction that pN≫N2/3pN\gg N^{2/3}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.