Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
From MaRDI portal
Publication:2431088
DOI10.1007/s11512-009-0117-1zbMath1223.05201arXiv0905.0972MaRDI QIDQ2431088
Svante Janson, Andrzej Ruciński
Publication date: 8 April 2011
Published in: Arkiv för Matematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.0972
Related Items
Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Line Percolation in Finite Projective Planes, Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process, On the Chromatic Index of Random Uniform Hypergraphs, Deviation probabilities for arithmetic progressions and other regular discrete structures, Counting extensions revisited, Deviation probabilities for arithmetic progressions and irregular discrete structures, Combinatorial theorems in sparse random sets, Upper tails for arithmetic progressions in random subsets, Threshold functions and Poisson convergence for systems of equations in random sets, Upper tails via high moments and entropic stability, Replica symmetry in upper tails of mean-field hypergraphs, On the missing log in upper tail estimates, Upper tail bounds for stars, A note on sparse supersaturation and extremal results for linear homogeneous systems, The lower tail: Poisson approximation revisited, A concentration result with application to subgraph count
Cites Work
- Unnamed Item
- Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
- On Schur properties of random subsets of integers
- Upper tails for subgraph counts in random graphs
- The deletion method for upper tail estimates
- On the Choice Number of Random Hypergraphs
- Chasing robbers on random graphs: Zigzag theorem
- Rado Partition Theorem for Random Subsets of Integers
- The infamous upper tail
