A sharp threshold of propagation connectivity for mixed random hypergraphs

MaRDI QIDQ6306754FDO

Authors Guangyan Zhou, Bin Wang, Ke Xu

Publication date 14 September 2018

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Hypergraphs (05C65)

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_{epsilon,r}<-1$, then $mathbbG$ is not propagation connected with high probability; while if $I_{epsilon,r}>-1$, then $mathbbG$ is propagation connected with high probability, where $I_{epsilon,r}$ is a constant dependent on the parameters of 2 and 3-edge probabilities.

This page was built for publication: A sharp threshold of propagation connectivity for mixed random hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6306754)