Jigsaw percolation on random hypergraphs
The jigsaw percolation process on graphs was introduced by Brummitt et al. (2015) as a model of collaborative solutions of puzzles in social networks. Percolation in this process may be viewed as the joint connectedness of two graphs on a common vertex set. Our aim is to extend a result of Bollobás et al. (2017) concerning this process to hypergraphs for a variety of possible definitions of connectedness. In particular, we determine the asymptotic order of the critical threshold probability for percolation when both hypergraphs are chosen binomially at random.
Journal of Applied Probability
Bollobás, B., Cooley, O., Kang, M., & Koch, C. (2017). Jigsaw percolation on random hypergraphs. Journal of Applied Probability, 54 (4), 1261-1277. https://doi.org/10.1017/jpr.2017.62