Detecting localized eigenstates of linear operators
Jianfeng Lu, Stefan Steinerberger

TL;DR
This paper introduces a method to detect localized eigenvectors of linear operators by analyzing the behavior of functions derived from powers of the operator, enabling identification of eigenvector localization in various types of matrices.
Contribution
The paper presents a novel approach using functions based on powers of the operator to identify localization of eigenvectors, supported by a fast randomized algorithm and diverse examples.
Findings
Eigenvectors with large eigenvalues localize around maxima of the defined functions.
The method effectively predicts localization in random band matrices and discretized operators.
The approach slows down power iteration convergence, indicating metastable states.
Abstract
We describe a way of detecting the location of localized eigenvectors of a linear system for eigenvalues with comparatively large. We define the family of functions where is a parameter and is the th standard basis vector. We prove that eigenvectors associated to eigenvalues with large absolute value localize around local maxima of : the metastable states in the power iteration method (slowing down its convergence) can be used to predict localization. We present a fast randomized algorithm and discuss different examples: a random band matrix, discretizations of the local operator and the nonlocal operator .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Matrix Theory and Algorithms · Sparse and Compressive Sensing Techniques
