On the singularity of random symmetric matrices
From MaRDI portal
Publication:2037848
DOI10.1215/00127094-2020-0054zbMath1467.60005arXiv1904.11478OpenAlexW3150991995MaRDI QIDQ2037848
Robert Morris, Letícia Mattos, Marcelo Campos, Natasha Morrison
Publication date: 8 July 2021
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.11478
Random matrices (probabilistic aspects) (60B20) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Singularity of sparse random matrices: simple proofs ⋮ On the smallest singular value of symmetric random matrices ⋮ Singularity of random symmetric matrices revisited ⋮ Bernoulli random matrices ⋮ Quantitative invertibility of non-Hermitian random matrices ⋮ The least singular value of a random symmetric matrix ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Singularity of random symmetric matrices -- simple proof ⋮ On the permanent of a random symmetric matrix ⋮ Invertibility of adjacency matrices for random \(d\)-regular graphs ⋮ Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices ⋮ On the counting problem in inverse Littlewood–Offord theory ⋮ The characteristic polynomial of a random matrix
Cites Work
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- Hypergraph containers
- Optimal inverse Littlewood-Offord theorems
- Random symmetric matrices are almost surely nonsingular.
- On the singularity probability of discrete random matrices
- Solution of the Littlewood-Offord problem in high dimensions
- Singularity of random Bernoulli matrices
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Non-asymptotic theory of random matrices: extreme singular values
- On the singularity probability of random Bernoulli matrices
- Smallest singular value of a random rectangular matrix
- Estimates for the concentration function of combinatorial number theory and probability
- On the Probability That a Random ± 1-Matrix Is Singular
- THE METHOD OF HYPERGRAPH CONTAINERS
- SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
- Independent sets in hypergraphs
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Invertibility of symmetric random matrices
- Small Ball Probability, Inverse Theorems, and Applications
- On the Kolmogorov-Rogozin inequality for the concentration function
- On a lemma of Littlewood and Offord
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item