Combinatorial anti-concentration inequalities, with applications
From MaRDI portal
Publication:4958638
DOI10.1017/S0305004120000183zbMath1472.05147arXiv1905.12142OpenAlexW3176679164MaRDI QIDQ4958638
Matthew Kwan, Lisa Sauermann, Jacob Fox
Publication date: 14 September 2021
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.12142
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ On the Littlewood‐Offord problem for arbitrary distributions ⋮ Bernoulli sums and Rényi entropy inequalities ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ Anti-concentration for subgraph counts in random graphs ⋮ On the permanent of a random symmetric matrix ⋮ Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices ⋮ Geometric and o-minimal Littlewood-Offord problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random symmetric matrices are almost surely nonsingular.
- A central limit theorem for decomposable random variables with applications to random graphs
- Probabilistic methods for algorithmic discrete mathematics
- Triangles in random graphs
- Contraction-deletion invariants for graphs
- On graphs determined by their Tutte polynomials
- Symmetrization and concentration inequalities for multilinear forms with applications to zero-one laws for Lévy chaos
- Anti-concentration for subgraph counts in random graphs
- The edge-statistics conjecture for \(\ell \ll k^{6/5} \)
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Anti-concentration for polynomials of independent random variables
- Real Advantage
- Combinatorial Nullstellensatz
- Foundations of Modern Probability
- Anti-concentration Inequalities for Polynomials
- Anticoncentration for subgraph statistics
- Edge-statistics on large graphs
- Acyclic subgraphs of tournaments with high chromatic number
- A completion of the proof of the Edge-statistics Conjecture
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Invariance principle on the slice
- Harmonicity and invariance on slices of the Boolean cube
- Small Ball Probability, Inverse Theorems, and Applications
- On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
- A local central limit theorem for triangles in a random graph
- On a lemma of Littlewood and Offord
- Concentration of multivariate polynomials and its applications
