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.
Related Researches
Submitted on 14 Jan 2016 (v1), last revised 13 Jun 2016 (this version, v3)
Updated
arXiv.org
Original Source