pith. sign in

arxiv: 1306.2887 · v2 · pith:D3GFVLYQnew · submitted 2013-06-12 · 🧮 math.PR

Delocalization of eigenvectors of random matrices with independent entries

classification 🧮 math.PR
keywords entriesrandomdelocalizationeigenvectorsindependentmatricesapproachbelow
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Hopfield Networks is All You Need

    cs.NE 2020-07 unverdicted novelty 7.0

    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...