On the probability of nonexistence in binomial subsets

DOI10.1214/19-AOP1371zbMath1451.60023arXiv1711.06216OpenAlexW3013965122MaRDI QIDQ2184826

Andreas Noever, Frank Mousset, Wojciech Samotij, Konstantinos D. Panagiotou

Publication date: 29 May 2020

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.06216

zbMATH Keywords

arithmetic progressionsJanson's inequalityjoint cumulantsHarris's inequalityrandom hyper graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Upper tails via high moments and entropic stability ⋮ Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence ⋮ Deviation probabilities for arithmetic progressions and irregular discrete structures ⋮ Bivariate fluctuations for the number of arithmetic progressions in random sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph containers
• A useful elementary correlation inequality
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• Limit theorems for complete subgraphs of random graphs
• For which densities are random triangle-free graphs almost surely bipartite?
• The typical structure of sparse $K_{r+1}$-free graphs
• The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph
• Threshold functions for small subgraphs
• Poisson approximation for large deviations
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• New versions of Suen's correlation inequality
• On the asymptotic structure of sparse triangle free graphs
• The Janson inequalities for general up‐sets
• Independent sets in hypergraphs
• The chromatic number of random graphs

This page was built for publication: On the probability of nonexistence in binomial subsets