On the missing log in upper tail estimates
From MaRDI portal
Publication:2284727
DOI10.1016/j.jctb.2019.05.003zbMath1430.05085arXiv1612.08561OpenAlexW3099438275WikidataQ127747160 ScholiaQ127747160MaRDI QIDQ2284727
Publication date: 15 January 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.08561
Related Items (10)
On the power of random greedy algorithms ⋮ Upper tails via high moments and entropic stability ⋮ Deviation probabilities for arithmetic progressions and other regular discrete structures ⋮ Counting extensions revisited ⋮ The jump of the clique chromatic number of random graphs ⋮ Bounds on Ramsey games via alterations ⋮ Upper Tails for Edge Eigenvalues of Random Graphs ⋮ Deviation probabilities for arithmetic progressions and irregular discrete structures ⋮ Upper Tail Bounds for Cycles ⋮ A counterexample to the DeMarco‐Kahn upper tail conjecture
Cites Work
- Extremal results for random discrete structures
- General deletion lemmas via the Harris inequality
- On the upper tail of counts of strictly balanced subgraphs
- When are small subgraphs of a random graph normally distributed?
- On Schur properties of random subsets of integers
- Upper tails for arithmetic progressions in random subsets
- Upper tails for subgraph counts in random graphs
- A BK inequality for randomly drawn subsets of fixed size
- Upper tail bounds for stars
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
- The deletion method for upper tail estimates
- The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\)
- Counting extensions
- On the Choice Number of Random Hypergraphs
- The lower tail: Poisson approximation revisited
- New bounds on cap sets
- The missing log in large deviations for triangle counts
- Sub-Gaussian Tails for the Number of Triangles inG(n, p)
- A concentration result with application to subgraph count
- Tight upper tail bounds for cliques
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- Inequalities with applications to percolation and reliability
- Poisson approximation for large deviations
- Random graphs with monochromatic triangles in every edge coloring
- On the concentration of multivariate polynomials with small expectation
- Concentration of non‐Lipschitz functions and applications
- The infamous upper tail
- THE CAMERON–ERDOS CONJECTURE
- New versions of Suen's correlation inequality
- Proof of the Van den Berg–Kesten Conjecture
- The Janson inequalities for general up‐sets
- A counterexample to the DeMarco‐Kahn upper tail conjecture
- On the Method of Typical Bounded Differences
- When does the K4‐free process stop?
- Concentration of multivariate polynomials and its applications
This page was built for publication: On the missing log in upper tail estimates
