Anticoncentration for subgraph statistics
From MaRDI portal
Publication:4967964
DOI10.1112/jlms.12192zbMath1415.05089arXiv1807.05202OpenAlexW2883840497MaRDI QIDQ4967964
No author found.
Publication date: 11 July 2019
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.05202
Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (13)
Singularity of the \(k\)-core of a random graph ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Friendly bisections of random graphs ⋮ Majority dynamics on sparse random graphs ⋮ Anticoncentration and Berry-Esseen bounds for random tensors ⋮ Finding unavoidable colorful patterns in multicolored graphs ⋮ The edge-statistics conjecture for \(\ell \ll k^{6/5} \) ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices ⋮ Combinatorial anti-concentration inequalities, with applications ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs ⋮ Edge-statistics on large graphs ⋮ The feasible region of induced graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adjacency matrices of random digraphs: singularity and anti-concentration
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- The correct exponent for the Gotsman-Linial conjecture
- Random symmetric matrices are almost surely nonsingular.
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- Unavoidable patterns
- Generalizations of the removal lemma
- The inducibility of graphs
- Logarithmic Sobolev inequality for some models of random walks
- Spectral properties of threshold functions
- A bound on the inducibility of cycles
- Graphs with a small number of distinct induced subgraphs
- Bilinear and quadratic variants on the Littlewood-Offord problem
- The average number of spanning trees in sparse graphs with given degrees
- On extremal problems of graphs and generalized graphs
- Ramsey graphs induce subgraphs of many different sizes
- On the exact maximum induced density of almost all graphs and their inducibility
- Logarithmic Sobolev inequalities for finite Markov chains
- An orthogonal basis for functions over a slice of the Boolean hypercube
- Anti-concentration for polynomials of independent random variables
- Real Advantage
- Sizes of Induced Subgraphs of Ramsey Graphs
- Induced subgraphs with distinct sizes
- The Gotsman-Linial Conjecture is False
- Algorithms with large domination ratio
- Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes
- Analysis of Boolean Functions
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- Invariance principle on the slice
- Harmonicity and invariance on slices of the Boolean cube
- Ramsey Theory for Discrete Structures
- Small Ball Probability, Inverse Theorems, and Applications
- Graphs Having Small Number of Sizes on Induced k‐Subgraphs
- A Combinatorial Central Limit Theorem
- On a problem of K. Zarankiewicz
- On the inducibility of cycles
This page was built for publication: Anticoncentration for subgraph statistics
