# On delocalization of eigenvectors of random non-Hermitian matrices

@article{Lytova2018OnDO,
title={On delocalization of eigenvectors of random non-Hermitian matrices},
author={Anna Lytova and Konstantin E. Tikhomirov},
journal={Probability Theory and Related Fields},
year={2018},
volume={177},
pages={465-524}
}
• Published 3 October 2018
• Mathematics
• Probability Theory and Related Fields
We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let A be an $$n\times n$$ n × n random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at least $$1-e^{-\log ^{2} n}$$ 1 - e - log 2 n \begin{aligned} \min \limits _{I\subset [n],\,|I|= m}\Vert \mathbf{{v}}_I\Vert \ge \frac{m^{3/2}}{n^{3/2}\log ^Cn}\Vert \mathbf{{v}}\Vert \end{aligned} min I ⊂ [ n ] , | I | = m ‖ v I ‖ ≥ m 3 / 2 n 3 / 2 log… Expand
Singularity of sparse Bernoulli matrices
• Mathematics
• 2020
Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$,Expand
The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding
• Mathematics
• 2020
We study the lower bound for Koldobsky’s slicing inequality. We show that there exists a measure μ and a symmetric convex body $$K \subseteq \mathbb R^n$$, such that for all \(\xi \in {{\mathbbExpand
Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
• Mathematics
• 2020
We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ ofExpand
Spectral radius of random matrices with independent entries
• Mathematics, Physics
• 2019
We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to theExpand
Eigenvector delocalization for non-Hermitian random matrices and applications
• Mathematics, Computer Science
• Random Struct. Algorithms
• 2020
This work establishes delocalization bounds for eigenvectors of independent-entry random matrices and shows that with high probability every eigenvector is delocalized, meaning any subset of its coordinates carries an appropriate proportion of its mass. Expand
THE SMALLEST SINGULAR VALUE OF INHOMOGENEOUS SQUARE RANDOM MATRICES BY GALYNA
• 2020
This extends earlier results [27, 24] by removing the assumption of mean zero and identical distribution of the entries across the matrix, as well as the recent result  where the matrix wasExpand
The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
We are concerned with the small ball behavior of the smallest singular value of random matrices. Often, establishing such results involves, in some capacity, a discretization of the unit sphere. ThisExpand
Asymmetry Helps: Eigenvalue and Eigenvector Analyses of Asymmetrically Perturbed Low-Rank Matrices
• Computer Science, Medicine
• Annals of statistics
• 2021
It is demonstrated that the leading eigenvalue of the data matrix M can be O ( n ) times more accurate than its (unadjusted) leading singular value of M in eigen value estimation, and the eigen-decomposition approach is fully adaptive to heteroscedasticity of noise, without the need of any prior knowledge about the noise distributions. Expand
Inference for linear forms of eigenvectors under minimal eigenvalue separation: Asymmetry and heteroscedasticity
• Mathematics, Computer Science
• ArXiv
• 2020
This work develops algorithms that produce confidence intervals for linear forms of individual eigenvectors, based on eigen-decomposition of the asymmetric data matrix followed by a careful de-biasing scheme, and establishes procedures to construct optimalconfidence intervals for the eigenvalues of interest. Expand
Local elliptic law
• Mathematics, Physics
• 2021
The empirical eigenvalue distribution of the elliptic random matrix ensemble tends to the uniform measure on an ellipse in the complex plane as its dimension tends to infinity. We show thisExpand