• Corpus ID: 119159038

Tail bounds for gaps between eigenvalues of sparse random matrices

@article{Lopatto2019TailBF,
  title={Tail bounds for gaps between eigenvalues of sparse random matrices},
  author={Patrick Lopatto and Kyle Luh},
  journal={arXiv: Probability},
  year={2019}
}
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 Erdős--Renyi graphs, weak and strong nodal domains are the same, answering a question of Dekel, Lee, and Linial. 
Noise sensitivity of second-top eigenvectors of Erdős-Rényi graphs and sparse matrices
We consider eigenvectors of adjacency matrices of Erdős-Rényi graphs and study the variation of their directions by resampling the entries randomly. Let v be the eigenvector associated with the
Noise sensitivity for the top eigenvector of a sparse random matrix
We investigate the noise sensitivity of the top eigenvector of a sparse random symmetric matrix. Let v be the top eigenvector of an N × N sparse random symmetric matrix with an average of d nonzero
Comparison theorem for some extremal eigenvalue statistics
We introduce a method for the comparison of some extremal eigenvalue statistics of random matrices. For example, it allows one to compare the maximal eigenvalue gap in the bulk of two generalized
Extreme gaps between eigenvalues of Wigner matrices
  • P. Bourgade
  • Mathematics, Physics
    Journal of the European Mathematical Society
  • 2021
This paper proves universality of the distribution of the smallest and largest gaps between eigenvalues of generalized Wigner matrices, under some smoothness assumption for the density of the
Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
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}$ of
How fast do quantum walks mix?
TLDR
An upper bound on the quantum mixing time for almost all networks is proved, i.e., the fraction of networks for which this bound holds, goes to one in the asymptotic limit.
On the smallest singular value of symmetric random matrices
We show that for an $n\times n$ random symmetric matrix $A_n$ , whose entries on and above the diagonal are independent copies of a sub-Gaussian random variable $\xi$
On analog quantum algorithms for the mixing of Markov chains
TLDR
An analog quantum algorithm is provided that given a Markov chain, allows us to sample from its stationary distribution in a time that scales as the sum of thesquare root of the classical mixing time and the square root ofThe classical hitting time.
Solving Sparse Linear Systems Faster than Matrix Multiplication
TLDR
This paper presents an algorithm that solves linear systems in sparse matrices asymptotically faster than matrix multiplication for any $\omega > 2$ and develops matrix anti-concentration techniques to bound the smallest eigenvalue and the smallest gap in eigenvalues of semi-random matrices.
Noise sensitivity of second-top eigenvectors of Erd\H{o}s-R\'{e}nyi graphs and sparse matrices
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

References

SHOWING 1-10 OF 74 REFERENCES
Random matrices: tail bounds for gaps between eigenvalues
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.
Extreme gaps between eigenvalues of random matrices
This paper studies the extreme gaps between eigenvalues of random matrices. We give the joint limiting law of the smallest gaps for Haar-distributed unitary matrices and matrices from the Gaussian
Smallest singular value of sparse random matrices
We extend probability estimates on the smallest singular value of random matrices with independent entries to a class of sparse random matrices. We show that one can relax a previously used condition
Random matrices: Universality of local eigenvalue statistics
In this paper, we consider the universality of the local eigenvalue statistics of random matrices. Our main result shows that these statistics are determined by the first four moments of the
Bulk universality of sparse random matrices
We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove
Random matrices have simple spectrum
TLDR
It is deduced that the Erdős-Rényi random graph has simple spectrum asymptotically almost surely, answering a question of Babai.
On construction and analysis of sparse random matrices and expander graphs with applications to compressed sensing
TLDR
This work revisits the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random and presents tail bounds on the probability that the cardinality of the set of neighbors for these graphs will be less than the expected value.
Smallest singular value of random matrices and geometry of random polytopes
Abstract We study the behaviour of the smallest singular value of a rectangular random matrix, i.e., matrix whose entries are independent random variables satisfying some additional conditions. We
Comparison theorem for some extremal eigenvalue statistics
We introduce a method for the comparison of some extremal eigenvalue statistics of random matrices. For example, it allows one to compare the maximal eigenvalue gap in the bulk of two generalized
Extreme gaps between eigenvalues of Wigner matrices
  • P. Bourgade
  • Mathematics, Physics
    Journal of the European Mathematical Society
  • 2021
This paper proves universality of the distribution of the smallest and largest gaps between eigenvalues of generalized Wigner matrices, under some smoothness assumption for the density of the
...
1
2
3
4
5
...