Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
From MaRDI portal
Publication:410097
DOI10.1215/00127094-1548344zbMath1276.15019arXiv1101.3074OpenAlexW2963301182MaRDI QIDQ410097
Publication date: 17 April 2012
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.3074
random matricessingularityquadratic formssymmetric matricesBernoulli random variablesarithmetic combinatoricsinverse Littlewood-Offord problemsrandom matrices (probabilistic aspects)relations with random matrices
Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52) Quadratic and bilinear forms, inner products (15A63) Relations with random matrices (11M50) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
The distribution of sandpile groups of random graphs ⋮ On the smallest singular value of symmetric random matrices ⋮ Adjacency matrices of random digraphs: singularity and anti-concentration ⋮ Non-abelian Littlewood-Offord inequalities ⋮ Singularity of random symmetric matrices revisited ⋮ Concentration of distances in Wigner matrices ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ 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 ⋮ On the number of integral graphs ⋮ Anti-concentration Inequalities for Polynomials ⋮ Bilinear and quadratic variants on the Littlewood-Offord problem ⋮ Random doubly stochastic matrices: the circular law ⋮ Singularity of random symmetric matrices -- simple proof ⋮ Small ball estimates for quasi-norms ⋮ Invertibility of symmetric random matrices ⋮ The rank of random regular digraphs of constant degree ⋮ SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ On the singularity of random symmetric matrices ⋮ Recent progress in combinatorial random matrix theory ⋮ Eigenvectors and controllability of non-Hermitian random matrices and directed graphs ⋮ Anticoncentration for subgraph statistics ⋮ On the permanent of a random symmetric matrix ⋮ Invertibility of adjacency matrices for random \(d\)-regular graphs ⋮ Surjectivity of near-square random matrices ⋮ Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices ⋮ Geometric and o-minimal Littlewood-Offord problems ⋮ On the concentration of random multilinear forms and the universality of random block matrices ⋮ Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors ⋮ Random integral matrices: universality of surjectivity and the cokernel
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal inverse Littlewood-Offord theorems
- Random symmetric matrices are almost surely nonsingular.
- On the singularity probability of discrete random matrices
- On subspaces spanned by random selections of \(\pm 1\) vectors
- Probability inequalities for convex sets and multidimensional concentration functions
- Symmetrization and concentration inequalities for multilinear forms with applications to zero-one laws for Lévy chaos
- Bilinear and quadratic variants on the Littlewood-Offord problem
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors
- A sharp inverse Littlewood-Offord theorem
- Two Uniform Limit Theorems for Sums of Independent Random Variables
- An Estimate for Concentration Functions
- On the singularity probability of random Bernoulli matrices
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- Estimates for the concentration function of combinatorial number theory and probability
- On the Probability That a Random ± 1-Matrix Is Singular
- Über ein Problem von Erdös und Moser
- On the Kolmogorov-Rogozin inequality for the concentration function
- On a lemma of Littlewood and Offord