Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence
arXiv:2205.10701 · doi:10.1016/j.aam.2022.102378
Abstract
Let integer and integer . Define the binomial random -uniform hypergraph to be the -uniform graph on the vertex set such that each -set is an edge independently with probability . A hypergraph is linear if every pair of hyperedges intersects in at most one vertex. We study the probability of linearity of random hypergraphs via cluster expansion and give more precise asymptotics of the probability in question, improving the asymptotic probability of linearity obtained by McKay and Tian, in particular, when and .
arXiv commentTo appear in Advances in Applied Mathematics
References in corpus (5)
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Algorithmic Pirogov-Sinai theory
- Clustering Bounds on N-Point Correlations for Unbounded Spin Systems
- When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence