No-gaps delocalization for general random matrices
Probability
2016-12-23 v1
Abstract
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 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.
Cite
@article{arxiv.1506.04012,
title = {No-gaps delocalization for general random matrices},
author = {Mark Rudelson and Roman Vershynin},
journal= {arXiv preprint arXiv:1506.04012},
year = {2016}
}
Comments
45 pages