Delocalization of eigenvectors of random matrices with independent entries
classification
🧮 math.PR
keywords
entriesrandomdelocalizationeigenvectorsindependentmatricesapproachbelow
read the original abstract
We prove that an n by n random matrix G with independent entries is completely delocalized. Suppose the entries of G have zero means, variances uniformly bounded below, and a uniform tail decay of exponential type. Then with high probability all unit eigenvectors of G have all coordinates of magnitude O(n^{-1/2}), modulo logarithmic corrections. This comes a consequence of a new, geometric, approach to delocalization for random matrices.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Hopfield Networks is All You Need
Modern Hopfield networks store exponentially many patterns, retrieve them in one update, and have an update rule equivalent to transformer attention, enabling new Hopfield layers that improve results on multiple insta...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.