{
  "id": "2207.04799",
  "version": "v1",
  "published": "2022-07-11T11:50:38.000Z",
  "updated": "2022-07-11T11:50:38.000Z",
  "title": "Connectivity of random hypergraphs with a given hyperedge size distribution",
  "authors": [
    "Elmer Bergman",
    "Lasse Leskelä"
  ],
  "comment": "18 pages",
  "categories": [
    "math.CO",
    "math.PR"
  ],
  "abstract": "This article discusses random hypergraphs with varying hyperedge sizes, admitting large hyperedges with size tending to infinity, and heavy-tailed limiting hyperedge size distributions. The main result describes a threshold for the random hypergraph to be connected with high probability, and shows that the average hyperedge size suffices to characterise connectivity under mild regularity assumptions. Especially, the connectivity threshold is in most cases insensitive to the shape and higher moments of the hyperedge size distribution. Similar results are also provided for related random intersection graph models.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-07-11T11:50:38.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C65",
      "60C05",
      "60B10",
      "91D30",
      "62G35"
    ],
    "keywords": [
      "connectivity",
      "limiting hyperedge size distributions",
      "article discusses random hypergraphs",
      "related random intersection graph models",
      "mild regularity assumptions"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 18,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}