Tail bounds for gaps between eigenvalues of sparse random matrices
From MaRDI portal
Publication:2076604
DOI10.1214/21-EJP669zbMATH Open1483.60008arXiv1901.05948OpenAlexW3215891045MaRDI QIDQ2076604FDOQ2076604
Publication date: 22 February 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Abstract: We prove the first eigenvalue repulsion bound for sparse random matrices. As a consequence, we show that these matrices have simple spectrum, improving the range of sparsity and error probability from the work of the second author and Vu. As an application of our tail bounds, we show that for sparse ErdH{o}s--R'enyi graphs, weak and strong nodal domains are the same, answering a question of Dekel, Lee, and Linial.
Full work available at URL: https://arxiv.org/abs/1901.05948
Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20)
Cites Work
- Title not available (Why is that?)
- Rigidity of eigenvalues of generalized Wigner matrices
- Low-Rank Approximation and Regression in Input Sparsity Time
- Nodal domains and spectral minimal partitions
- Eigenfunctions and nodal sets
- Random matrices: Universality of local eigenvalue statistics up to the edge
- Wegner Estimate and Level Repulsion for Wigner Random Matrices
- Random matrices: universality of local eigenvalue statistics
- Invertibility of symmetric random matrices
- Random covariance matrices: universality of local statistics of eigenvalues
- Universality of random matrices and local relaxation flow
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Small Ball Probability, Inverse Theorems, and Applications
- Smallest singular value of random matrices and geometry of random polytopes
- Bulk universality of sparse random matrices
- Spectral statistics of Erdős-Rényi graphs II: eigenvalue spacing and the extreme eigenvalues
- Universality of covariance matrices
- Transport maps for \(\beta\)-matrix models and universality
- Invertibility of random matrices: norm of the inverse
- The asymptotic distribution of a single eigenvalue gap of a Wigner matrix
- Change of variables as a method to study general β-models: Bulk universality
- Invertibility of sparse non-Hermitian matrices
- Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
- Bulk universality for Wigner matrices
- Extreme gaps between eigenvalues of random matrices
- Eigenvectors of random graphs: Nodal Domains
- Random matrices: The Four Moment Theorem for Wigner ensembles
- On the second eigenfunctions of the Laplacian in \({\mathbb{R}}^ 2\)
- Gap universality of generalized Wigner and \(\beta\)-ensembles
- An eigendecomposition approach to weighted graph matching problems
- Universality and the circular law for sparse random matrices
- A sparse Johnson-Lindenstrauss transform
- Smallest singular value of sparse random matrices
- Universality in several-matrix models via approximate transport maps
- Universality of random matrices with correlated entries
- Sparse signal recovery using a new class of random matrices
- Random matrices have simple spectrum
- Random matrices: tail bounds for gaps between eigenvalues
- Entrywise bounds for eigenvectors of random graphs
- Eigenvectors of random matrices: A survey
- Local law and Tracy-Widom limit for sparse random matrices
- Bulk universality for generalized Wigner matrices with few moments
- Local spectral statistics of the addition of random matrices
- Eigenvector statistics of sparse random matrices
- GOE statistics for Lévy matrices
- On the Number of Nodal Domains for Eigenfunctions of Elliptic Differential Operators
- Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing
- Small gaps of GOE
- Small gaps of circular \(\beta \)-ensemble
- Comparison theorem for some extremal eigenvalue statistics
- Sparse random matrices have simple spectrum
- Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
- Universality of the least singular value for sparse random matrices
- Size of nodal domains of the eigenvectors of a graph
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
Cited In (2)
This page was built for publication: Tail bounds for gaps between eigenvalues of sparse random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076604)
