Eigenvector statistics of sparse random matrices

Paul Bourgade, Jiaoyang Huang, Horng Tzer Yau

Research output: Contribution to journalArticlepeer-review


We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of Erdős-Rényi graphs or random regular graphs, are asymptotically jointly normal, provided the averaged degree increases with the size of the graphs. Our methodology follows [6] by analyzing the eigenvector flow under Dyson Brownian motion, combined with an isotropic local law for Green’s function. As an auxiliary result, we prove that for the eigenvector flow of Dyson Brownian motion with general initial data, the eigenvectors are asymptotically jointly normal in the direction q after time η ≪ t ≪ r, if in a window of size r, the initial density of states is bounded below and above down to the scale η, and the initial eigenvectors are delocalized in the direction q down to the scale η.

Original languageEnglish (US)
Article number64
JournalElectronic Journal of Probability
StatePublished - 2017


  • Eigenvectors
  • Isotropic local law
  • Sparse random graphs

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'Eigenvector statistics of sparse random matrices'. Together they form a unique fingerprint.

Cite this