Random Recursive Hypergraphs
arXiv:2212.07371 · doi:10.1088/1751-8121/accac0
Abstract
Random recursive hypergraphs grow by adding, at each step, a vertex and an edge formed by joining the new vertex to a randomly chosen existing edge. The model is parameter-free, and several characteristics of emerging hypergraphs admit neat expressions via harmonic numbers, Bernoulli numbers, Eulerian numbers, and Stirling numbers of the first kind. Natural deformations of random recursive hypergraphs give rise to fascinating models of growing random hypergraphs.
13 pages, 1 figure; v3: minor updates, references added
References in corpus (14)
- Scale-free brain functional networks
- Hierarchical modularity in human brain functional networks
- Dynamics on higher-order networks: A review
- Dynamics of Social Balance on Networks
- Social Balance on Networks: The Dynamics of Friendship and Enmity
- Random hypergraphs and their applications
- Structural Transitions in Dense Networks
- The power of choice in network growth
- A record-driven growth process
- A class of models for random hypergraphs
- First Passage Properties of the Polya Urn Process
- Emergent Network Modularity
- Random Ancestor Trees
- Sparse SYK and traversable wormholes