Name
Abstract | ||
|---|---|---|
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 Bollobas 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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1017/jpr.2017.62 | JOURNAL OF APPLIED PROBABILITY |
Keywords | Field | DocType |
Jigsaw percolation,random graph,hypergraph,high-order connectedness,breadth-first search | Discrete mathematics,Social connectedness,Combinatorics,Vertex (geometry),Constraint graph,Chatterjee,Percolation threshold,Percolation,Continuum percolation theory,Jigsaw,Mathematics | Journal |
Volume | Issue | ISSN |
54 | 4 | 0021-9002 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Béla Bollobás | 1 | 2696 | 474.16 |
| Oliver Cooley | 2 | 39 | 9.15 |
| Mihyun Kang | 3 | 163 | 29.18 |
| Christoph Koch | 4 | 1 | 0.72 |