2011 · 230 citations · 38 references
Natural SciencesComputer ScienceMathematicsCombinatoricsProbability TheoryStochastic ProcessesGraph TheoryProbabilistic CombinatoricsSpectral TheoryAdjacency MatricesEigenvaluesEigenvectorsErdős - Rényi GraphsRandom Graph TheoryRandom GraphsRandom MatricesRandom Matrix Theory
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 semicircle law for spectral windows of length larger than N −1 (up to logarithmic corrections). As a consequence, all eigenvectors are proved to be completely delocalized in the sense that the ℓ ∞-norms of the ℓ 2-normalized eigenvectors are at most of order N −1/2 with a very high probability. The estimates in this paper will be used in the companion paper [13] to prove the universality of eigenvalue distributions both in the bulk and at the spectral edges under the further restriction that pN ≫ N 2/3.
38
Percy Deift, T. Kriecherbauer, K. T-R McLaughlin et al. · Communications on Pure and Applied Mathematics · 1999 · 850 citations
Random matrices: Universality of local eigenvalue statistics
Terence Tao, Van Vu · Acta Mathematica · 2011 · 454 citations · Full text