CaltechAUTHORS
Published November 2016 | Version Submitted
Journal Article Open

Eigenvectors of random matrices: A survey

Creators

  • 1. ROR icon University of Colorado Boulder
  • 2. ROR icon Yale University
  • 3. ROR icon Hong Kong University of Science and Technology
  • 4. ROR icon California Institute of Technology

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.

Additional Information

© 2016 Elsevier Inc. Available online 15 July 2016. The first author thanks Professor Roman Vershynin for clarifications. The third author would like to thank Professor Tiefeng Jiang for many useful discussions and constant encouragement. The authors also thank the anonymous referee for valuable comments.

Attached Files

Submitted - 1601.03678v3.pdf

Files

1601.03678v3.pdf

Files (677.5 kB)

Name Size
md5:6b824259181cb3270ef4b7a7498703d3
677.5 kB Preview Download

Additional details

Identifiers

Eprint ID
70254
DOI
10.1016/j.jcta.2016.06.008
Resolver ID
CaltechAUTHORS:20160909-135327602

Related works

Describes
10.1016/j.jcta.2016.06.008 (DOI)
https://arxiv.org/abs/1601.03678 (URL)

Dates

Created
2016-09-09
Created from EPrint's datestamp field
Updated
2021-11-11
Created from EPrint's last_modified field