Eigenvectors of random matrices: A survey

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:144

Article

O'Rourke, Sean¹  Vu, Van²  Wang, Ke^3,4 

[1] Univ Colorado, Dept Math, Boulder, CO 80309 USA

[2] Yale Univ, Dept Math, New Haven, CT 06520 USA

[3] Hong Kong Univ Sci & Technol, Jockey Club Inst Adv Study, Hong Kong, Hong Kong, Peoples R China

[4] CALTECH, Comp & Math Sci, Pasadena, CA 91125 USA

关键词: Eigenvectors;    Random matrix;    Random graph;    Adjacency matrix;    Random regular graph;   

DOI  :  10.1016/j.jcta.2016.06.008

来源: Elsevier

【 摘 要 】

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. Published by Elsevier Inc.

【 授权许可】

Free