Delocalization at small energy for heavy-tailed random matrices
Abstract
We prove that the eigenvectors associated to small enough eigenvalues of an heavy-tailed symmetric random matrix are delocalized with probability tending to one as the size of the matrix grows to infinity. The delocalization is measured thanks to a simple criterion related to the inverse participation ratio which computes an average ratio of L4 and L2-norms of vectors. In contrast, as a consequence of a previous result, for random matrices with sufficiently heavy tails, the eigenvectors associated to large enough eigenvalues are localized according to the same criterion. The proof is based on a new analysis of the fixed point equation satisfied asymptotically by the law of a diagonal entry of the resolvent of this matrix.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.