Skip to main content Accessibility help

Jigsaw percolation on random hypergraphs

  • Béla Bollobás (a1), Oliver Cooley (a2), Mihyun Kang (a2) and Christoph Koch (a2)


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.


Corresponding author

* Postal address: Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, UK. Email address:
** Postal address: Institute of Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010 Graz, Austria.
*** Email address:
**** Email address:
***** Current address: Mathematics Institute, University of Warwick, Zeeman Building, CV4 7AL Coventry, UK. Email address:


Hide All
[1] Ball, P. (2014). Crowd-sourcing: strength in numbers. Nature 506, 422423.
[2] Barabási, A. L. et al. (2002). Evolution of the social network of scientific collaborations. Phys. A 311, 590614.
[3] Bollobás, B., Riordan, O., Slivken, E. and Smith, P. (2017). The threshold for jigsaw percolation on random graphs. Electron. J. Combin. 24, 2.36.
[4] Brummitt, C. D., Chatterjee, S., Dey, P. S. and Sivakoff, D. (2015). Jigsaw percolation: what social networks can collaboratively solve a puzzle? Ann. Appl. Prob. 25, 20132038.
[5] Cooley, O., Kang, M. and Koch, C. (2016). Threshold and hitting time for high-order connectedness in random hypergraphs. Electron. J. Combin. 23, 2.48.
[6] Gravner, J. and Sivakoff, D. (2017). Nucleation scaling in jigsaw percolation. Ann. Appl. Prob. 27, 395438.
[7] Gutiérrez Sanchez, A. (2017). Multi-colored jigsaw percolation on random graphs. Master's Thesis. Graz University of Technology.
[8] Newman, M. E. J. (2001). Scientific collaboration networks. I. Network construction and fundamental results. Phys. Rev. E 64, 016131.
[9] Newman, M. E. J. (2001). Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Phys. Rev. E 64, 016132.
[10] Newman, M. E. J. (2001). The structure of scientific collaboration networks. Proc. Nat. Acad. Sci. USA 98, 404409.
[11] Tebbe, J. (2011). Book review: Where good ideas come from: the natural history of innovation. J. Psychological Issues Organizational Culture 2, 106110.


MSC classification

Jigsaw percolation on random hypergraphs

  • Béla Bollobás (a1), Oliver Cooley (a2), Mihyun Kang (a2) and Christoph Koch (a2)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed