{
  "id": "1603.07883",
  "version": "v1",
  "published": "2016-03-25T11:20:59.000Z",
  "updated": "2016-03-25T11:20:59.000Z",
  "title": "Jigsaw percolation on random hypergraphs",
  "authors": [
    "Béla Bollobás",
    "Oliver Cooley",
    "Mihyun Kang",
    "Christoph Koch"
  ],
  "comment": "15 pages",
  "categories": [
    "math.CO",
    "math.PR"
  ],
  "abstract": "The jigsaw percolation process on graphs was introduced by Brummitt, Chatterjee, Dey, and Sivakoff 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\\'as, Riordan, Slivken, and Smith 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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-03-25T11:20:59.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80",
      "60K35",
      "05C65"
    ],
    "keywords": [
      "random hypergraphs",
      "jigsaw percolation process",
      "common vertex set",
      "joint connectedness",
      "asymptotic order"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2016arXiv160307883B"
    }
  }
}