Abstract
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, that is, graphs on vertices where every edge is chosen independently and with probability . We rescale the matrix so that its bulk eigenvalues are of order one. We prove that, as long as (with a speed at least logarithmic in ), 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 (up to logarithmic corrections). As a consequence, all eigenvectors are proved to be completely delocalized in the sense that the -norms of the -normalized eigenvectors are at most of order 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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.