The Janson inequalities for general up‐sets
From MaRDI portal
Publication:4982621
DOI10.1002/rsa.20506zbMath1314.60079arXiv1203.1024OpenAlexW3105611710MaRDI QIDQ4982621
Publication date: 9 April 2015
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.1024
Related Items (15)
Upper tails for arithmetic progressions in random subsets ⋮ On the probability of nonexistence in binomial subsets ⋮ Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors ⋮ Counting extensions revisited ⋮ The jump of the clique chromatic number of random graphs ⋮ The median of the number of simple paths on three vertices in the random graph ⋮ On the concentration of the chromatic number of random graphs ⋮ On the Method of Typical Bounded Differences ⋮ Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs ⋮ On the distribution of the maximum \(k\)-degrees of the binomial random graph ⋮ The lower tail: Poisson approximation revisited ⋮ On the missing log in upper tail estimates ⋮ A counterexample to the DeMarco‐Kahn upper tail conjecture ⋮ Upper tail bounds for stars ⋮ The distribution of the maximum number of common neighbors in the random graph
Cites Work
- Unnamed Item
- Poisson convergence and Poisson processes with applications to random graphs
- A useful elementary correlation inequality
- Correlation inequalities on some partially ordered sets
- Poisson approximation for large deviations
- Families of Non-disjoint subsets
- Concentration of multivariate polynomials and its applications
This page was built for publication: The Janson inequalities for general up‐sets