Jigsaw percolation on random hypergraphs

DOI10.1017/jpr.2017.62zbMath1396.05099arXiv1603.07883OpenAlexW2964202385MaRDI QIDQ4684919

Christoph Koch, Oliver Cooley, Mihyun Kang, Béla Bollobás

Publication date: 26 September 2018

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.07883

zbMATH Keywords

hypergraphrandom graphbreadth-first searchjigsaw percolationhigh-order connectedness

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items (3)

The size of the giant joint component in a binomial random double graph ⋮ Bivariate fluctuations for the number of arithmetic progressions in random sets ⋮ The sharp threshold for jigsaw percolation in random graphs

Cites Work

• Nucleation scaling in jigsaw percolation
• Evolution of the social network of scientific collaborations
• Jigsaw percolation: what social networks can collaboratively solve a puzzle?
• The threshold for jigsaw percolation on random graphs
• Threshold and hitting time for high-order connectedness in random hypergraphs
• From the Cover: The structure of scientific collaboration networks

This page was built for publication: Jigsaw percolation on random hypergraphs