Corpus ID: 210156949

# Noise sensitivity of second-top eigenvectors of Erd\H{o}s-R\'{e}nyi graphs and sparse matrices

@article{Lee2020NoiseSO,
title={Noise sensitivity of second-top eigenvectors of Erd\H\{o\}s-R\'\{e\}nyi graphs and sparse matrices},
author={Jaehun Lee},
journal={arXiv: Probability},
year={2020}
}
• Jaehun Lee
• Published 2020
• Mathematics
• arXiv: Probability
We consider eigenvectors of adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs and study the variation of their directions by resampling the entries randomly. Let $\mathbf{v}$ be the eigenvector associated with the second-largest eigenvalue of the Erd\H{o}s-R\'{e}nyi graphs. After choosing $k$ entries of the given matrix randomly and resampling them, we obtain another eigenvector $\mathbf{w}$ corresponding to the second-largest eigenvalue of the matrix obtained from the resampling procedure. We… Expand

#### References

SHOWING 1-10 OF 14 REFERENCES
Sparse random matrices have simple spectrum
• Mathematics
• 2018
Let $M_n$ be a class of symmetric sparse random matrices, with independent entries $M_{ij} = \delta_{ij} \xi_{ij}$ for $i \leq j$. $\delta_{ij}$ are i.i.d. Bernoulli random variables taking the valueExpand
Noise sensitivity of the top eigenvector of a Wigner matrix
• Mathematics
• 2019
We investigate the noise sensitivity of the top eigenvector of a Wigner matrix in the following sense. Let v be the top eigenvector of an $$N\times N$$ N × N Wigner matrix. Suppose that k randomlyExpand
Largest eigenvalues of sparse inhomogeneous Erdős–Rényi graphs
• Mathematics
• The Annals of Probability
• 2019
We consider inhomogeneous Erd\H{o}s-R\'enyi graphs. We suppose that the maximal mean degree $d$ satisfies $d \ll \log n$. We characterize the asymptotic behavior of the $n^{1 - o(1)}$ largestExpand
Local law and complete eigenvector delocalization for supercritical Erdős–Rényi graphs
• Mathematics, Physics
• The Annals of Probability
• 2019
We prove a local law for the adjacency matrix of the Erdős-Renyi graph $G(N, p)$ in the supercritical regime $pN \geq C\log N$ where $G(N,p)$ has with high probability no isolated vertices. In theExpand
The Largest Eigenvalue of Sparse Random Graphs
• Mathematics, Computer Science
• Combinatorics, Probability and Computing
• 2003
We prove that, for all values of the edge probability $p(n)$, the largest eigenvalue of the random graph $G(n, p)$ satisfies almost surely $\lambda_1(G)=(1+o(1))\max\{\sqrt{\Delta}, np\}$, where Δ isExpand
Spectral Statistics of Erdős-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues
• Mathematics, Physics
• 2012
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertices where every edge is chosen independently and with probability p ≡ p(N). We rescale the matrix soExpand
Spectral radii of sparse random matrices
• Mathematics
• 2017
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erdős-Renyi graphs. Our error bounds are sharp for aExpand
Eigenvector Statistics of Sparse Random Matrices
• Mathematics
• 2016
We prove that the bulk eigenvectors of sparse random matrices, i.e. the adjacency matrices of Erdős-Renyi graphs or random regular graphs, are asymptotically jointly normal, provided the averagedExpand
Spectral statistics of Erdős–Rényi graphs I: Local semicircle law
• Mathematics, Physics
• 2013
We consider the ensemble of adjacency matrices of Erdős–Renyi random graphs, that is, graphs on N vertices where every edge is chosen independently and with probability p≡p(N). We rescale the matrixExpand
The Isotropic Semicircle Law and Deformation of Wigner Matrices
• Mathematics, Physics
• 2011
We analyze the spectrum of additive finite-rank deformations of N × N Wigner matrices H. The spectrum of the deformed matrix undergoes a transition, associated with the creation or annihilation of anExpand