Eigenvectors of random matrices: A survey
Probability
2016-06-14 v3 Combinatorics
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.
Keywords
Cite
@article{arxiv.1601.03678,
title = {Eigenvectors of random matrices: A survey},
author = {Sean O'Rourke and Van Vu and Ke Wang},
journal= {arXiv preprint arXiv:1601.03678},
year = {2016}
}
Comments
64 pages, 1 figure; added Section 7 on localized eigenvectors