Connectivity of random hypergraphs with a given hyperedge size distribution
From MaRDI portal
Publication:6404597
DOI10.1016/J.DAM.2024.05.045arXiv2207.04799MaRDI QIDQ6404597FDOQ6404597
Authors: Elmer Bergman, Lasse Leskelä 
Publication date: 11 July 2022
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.
Convergence of probability measures (60B10) Nonparametric robustness (62G35) Social networks; opinion dynamics (91D30) Combinatorial probability (60C05) Hypergraphs (05C65)
This page was built for publication: Connectivity of random hypergraphs with a given hyperedge size distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404597)
