A sharp threshold of propagation connectivity for mixed random hypergraphs

2018/09/15 by Zhou, Guangyan, Wang, Bin, Xu, Ke
#05C65 #68Q87 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1809.05631

Abstract

This paper studies the propagation connectivity of a random hypergraph \mathbbG containing both 2-edges and 3-hyperedges. We find an exact threshold of the propagation connectivity of \mathbbG: If I_ε,r-1, then \mathbbG is propagation connected with high probability, where I_ε,r is a constant dependent on the parameters of 2 and 3-edge probabilities.

Related

• Threshold and hitting time for high-order connectivity in random hypergraphs
• On the connectivity threshold for colorings of random graphs and hypergraphs
• Connectivity of Random Geometric Hypergraphs
• A random triadic process
• On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs