Eigenvectors of random matrices: A survey
arXiv:1601.03678
Abstract
Eigenvectors of large matrices (and graphs) play an essential role in combinatorics and theoretical computer science. The goal of this survey is to provide an up-to-date account on properties of eigenvectors when the matrix (or graph) is random.
64 pages, 1 figure; added Section 7 on localized eigenvectors
References in corpus (7)
- Finding community structure in networks using the eigenvectors of matrices
- Local semicircle law and complete delocalization for Wigner random matrices
- Delocalization at small energy for heavy-tailed random matrices
- Random matrices have simple spectrum
- Controllability of random systems: Universality and minimal controllability
- Random matrices: tail bounds for gaps between eigenvalues
- No-gaps delocalization for general random matrices