Jigsaw percolation on random hypergraphs
| Autor: | Béla Bollobás, Christoph Koch, Mihyun Kang, Oliver Cooley |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Statistics and Probability
Discrete mathematics Random graph Vertex (graph theory) Hypergraph Social connectedness Computer Science::Information Retrieval General Mathematics 0102 computer and information sciences 01 natural sciences Jigsaw Set (abstract data type) 010104 statistics & probability 010201 computation theory & mathematics Percolation 0101 mathematics Statistics Probability and Uncertainty Variety (universal algebra) Mathematics |
| Zdroj: | Journal of Applied Probability. 54:1261-1277 |
| ISSN: | 1475-6072 0021-9002 |
| DOI: | 10.1017/jpr.2017.62 |
| Popis: | The jigsaw percolation process on graphs was introduced by Brummittet 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áset 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|