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.
arXiv comment13 pages, 1 figure; v3: minor updates, references added
References in corpus (43)
- Scale-free brain functional networks
- Higher-order organization of complex networks
- Organization of Growing Random Networks
- Hierarchical modularity in human brain functional networks
- Dynamics on higher-order networks: A review
- Dynamics of Majority Rule
- Dynamics of Social Balance on Networks
- Social Balance on Networks: The Dynamics of Friendship and Enmity
- Random hypergraphs and their applications
- Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
- The energy landscape of social balance
- Duplication-divergence model of protein interaction network
- Log-Networks
- Emergent Hyperbolic Network Geometry
- Network geometry with flavor: from complexity to quantum geometry
- Finiteness and Fluctuations in Growing Networks
- Higher-order percolation processes on multiplex hypergraphs
- Structural Transitions in Dense Networks
- Sparse Sachdev-Ye-Kitaev model, quantum chaos and gravity duals
- The power of choice in network growth
- Statistics of Lead Changes in Popularity-Driven Systems
- Network Geometry and Complexity
- Exponential Random Simplicial Complexes
- Complex network view of evolving manifolds
- A record-driven growth process
- A class of models for random hypergraphs
- Randomizing hypergraphs preserving degree correlation and local clustering
- Biased landscapes for random Constraint Satisfaction Problems
- Phase transitions in the -coloring of random hypergraphs
- Preferential attachment with choice
- First Passage Properties of the Polya Urn Process
- Choice-Driven Phase Transition in Complex Networks
- Emergent Network Modularity
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication
- Random Simplicial Complexes: Models and Phenomena
- Highly Dispersed Networks Generated by Enhanced Redirection
- Spectra of random regular hypergraphs
- The diameter of random Belyi surfaces
- Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication
- Random Ancestor Trees
- The asymptotics of the clustering transition for random constraint satisfaction problems
- Spanning trees in random regular uniform hypergraphs
- Sparse SYK and traversable wormholes