arXiv Analytics

Sign in

arXiv:1506.04012 [math.PR]AbstractReferencesReviewsResources

No-gaps delocalization for general random matrices

Mark Rudelson, Roman Vershynin

Published 2015-06-12Version 1

We prove that with high probability, every eigenvector of a random matrix is delocalized in the sense that any subset of its coordinates carries a non-negligible portion of its $\ell_2$ norm. Our results pertain to a wide class of random matrices, including matrices with independent entries, symmetric and skew-symmetric matrices, as well as some other naturally arising ensembles. The matrices can be real and complex; in the latter case we assume that the real and imaginary parts of the entries are independent.

Related articles: Most relevant | Search more
arXiv:0902.1156 [math.PR] (Published 2009-02-06, updated 2012-08-10)
On the spread of random graphs
arXiv:1407.2860 [math.PR] (Published 2014-07-10, updated 2014-12-23)
Increasing subsequences of random walks
arXiv:2210.15320 [math.PR] (Published 2022-10-27)
On Hadamard powers of Random Wishart matrices