Connectivity of Random Geometric Hypergraphs

Henry-Louis De Kergorlay, Desmond J Higham

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie within a certain radius. From a modelling perspective, we explain how the model captures higher-order connections that arise in real data sets. Our main contribution is to study the connectivity properties of the model. In an asymptotic limit where the number of nodes and hyperedges grow in tandem, we give a condition on the radius that guarantees connectivity.
Original languageEnglish
Article numbere25111555
Issue number11
Publication statusPublished - 17 Nov 2023


Dive into the research topics of 'Connectivity of Random Geometric Hypergraphs'. Together they form a unique fingerprint.

Cite this