Random matrices: tail bounds for gaps between eigenvalues
From MaRDI portal
Abstract: Gaps (or spacings) between consecutive eigenvalues are a central topic in random matrix theory. The goal of this paper is to study the tail distribution of these gaps in various random matrix models. We give the first repulsion bound for random matrices with discrete entries and the first super-polynomial bound on the probability that a random graph has simple spectrum, along with several applications.
The authors focus on gaps between consecutive eigenvalues of random Hermitian matrices. In particular, they study the tail distribution of these gaps for several random matrix models. They derive bounds on the probability that a random graph has a simple spectrum. Some applications are given.
Recommendations
Cites work
- A pattern analysis of the second Rehnquist U.S. Supreme Court
- A sharp inverse Littlewood-Offord theorem
- An introduction to random matrices
- Bulk universality of sparse random matrices
- Convergence of local statistics of Dyson Brownian motion
- Eigenvectors of random graphs: nodal domains
- Estimates for the concentration function of combinatorial number theory and probability
- Extreme gaps between eigenvalues of random matrices
- Fixed energy universality for generalized Wigner matrices
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps
- scientific article; zbMATH DE number 1234098 (Why is no real title available?)
- scientific article; zbMATH DE number 1962932 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Invertibility of symmetric random matrices
- Nodal domains on graphs - How to count them and why?
- On a lemma of Littlewood and Offord
- Optimal inverse Littlewood-Offord theorems
- Random matrices have simple spectrum
- Random matrices: The universality phenomenon for Wigner ensembles
- Random matrices: universality of local eigenvalue statistics
- Random matrices: Universality of local eigenvalue statistics up to the edge
- Small ball probability, inverse theorems, and applications
- Smallest singular value of a random rectangular matrix
- Smallest singular value of random matrices and geometry of random polytopes
- Smooth analysis of the condition number and the least singular value
- Spectral statistics of Erdős-Rényi graphs II: eigenvalue spacing and the extreme eigenvalues
- The asymptotic distribution of a single eigenvalue gap of a Wigner matrix
- The Littlewood-Offord problem and invertibility of random matrices
- The Wigner-Dyson-Mehta bulk universality conjecture for Wigner matrices
- Universality for random matrix flows with time-dependent density
- Universality of local eigenvalue statistics in random matrices with external source
- Universality of local spectral statistics of random matrices
- Wegner Estimate and Level Repulsion for Wigner Random Matrices
Cited in
(30)- Random matrices: overcrowding estimates for the spectrum
- Random matrices have simple spectrum
- Random matrices: probability of normality
- Small gaps of GOE
- Sparse random matrices have simple spectrum
- Recent progress in combinatorial random matrix theory
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
- Tail bounds for gaps between eigenvalues of sparse random matrices
- Extreme gaps between eigenvalues of Wigner matrices
- Comparison theorem for some extremal eigenvalue statistics
- On the geometry of the set of symmetric matrices with repeated eigenvalues
- Convergence of local statistics of Dyson Brownian motion
- Concentration of distances in Wigner matrices
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- Matrix regularizing effects of Gaussian perturbations
- Extreme gaps between eigenvalues of random matrices
- Eigenvectors of random matrices of symmetric entry distributions
- Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
- On the smallest singular value of symmetric random matrices
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- The least singular value of a random symmetric matrix
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Smallest gaps between eigenvalues of real Gaussian matrices
- Solving sparse linear systems faster than matrix multiplication
- Phase transition for the bottom singular vector of rectangular random matrices
- Curse of dimensionality on persistence diagrams
- Eigenvalue gaps of random perturbations of large matrices
- Private low-rank approximation for covariance matrices, Dyson Brownian motion, and eigenvalue-gap bounds for Gaussian perturbations
- Local and global universality of random matrix cokernels
- No-gaps delocalization for general random matrices
This page was built for publication: Random matrices: tail bounds for gaps between eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525097)
