Noise sensitivity for the top eigenvector of a sparse random matrix
From MaRDI portal
Publication:2136103
DOI10.1214/22-EJP770zbMath1489.15048arXiv2106.09570OpenAlexW3171053211MaRDI QIDQ2136103
Publication date: 10 May 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09570
Random matrices (probabilistic aspects) (60B20) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52)
Cites Work
- Unnamed Item
- Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
- Universality of sine-kernel for Wigner matrices with a small Gaussian perturbation
- Spectral statistics of Erdős-Rényi graphs II: eigenvalue spacing and the extreme eigenvalues
- No-gaps delocalization for general random matrices
- Noise sensitivity of the top eigenvector of a Wigner matrix
- Local law and Tracy-Widom limit for sparse random matrices
- Sparse random matrices have simple spectrum
- Fluctuations of extreme eigenvalues of sparse Erdős-Rényi graphs
- Tail bounds for gaps between eigenvalues of sparse random matrices
- Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
- Local law and complete eigenvector delocalization for supercritical Erdős-Rényi graphs
- Stein's method for concentration inequalities
- Eigenvector statistics of sparse random matrices
- Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
- The Isotropic Semicircle Law and Deformation of Wigner Matrices
- Superconcentration and Related Topics
- The Largest Eigenvalue of Sparse Random Graphs
- Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
- Size of nodal domains of the eigenvectors of a graph
- Noise Sensitivity of Boolean Functions and Percolation
- A Dynamical Approach to Random Matrix Theory
- Noise sensitivity of Boolean functions and applications to percolation
This page was built for publication: Noise sensitivity for the top eigenvector of a sparse random matrix