Improving upon results of Rudelson and Vershynin, we establish delocalization bounds for eigenvectors of independent-entry random matrices. In particular, we show that with high probability every eigenvector is delocalized, meaning any subset of its coordinates carries an appropriate proportion of its mass. Our results hold for random matrices with genuinely complex as well as real entries. As an application of our methods, we also establish delocalization bounds for normal vectors to random hyperplanes. The proofs of our main results rely on a least singular value bound for genuinely complex rectangular random matrices, which generalizes a previous bound due to the first author, and may be of independent interest.
DateHere c 1 , c 2 , c 3 depend on p, k, and M .Remark. We have stated Theorem 1.5 for real iid random matrices, but the results in [43] also extend to the case where the (i, j)-entry depends on the (j, i)-entry as well as the case when the entries are complex-valued. We refer the reader to [43, Section 1] for details.In view of numerical simulations and heuristic arguments coming from (1.4) and (1.5), the bounds in Theorem 1.5 appear to be suboptimal. In this article, we improve the bounds in Theorem 1.5 for random matrices with genuinely complex entries.