Abstract
Abstract
Random recursive hypergraphs (RRHs) 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 RRHs give rise to fascinating models of growing random hypergraphs.
Subject
General Physics and Astronomy,Mathematical Physics,Modeling and Simulation,Statistics and Probability,Statistical and Nonlinear Physics
Reference114 articles.
1. Graphs, simplicial complexes and hypergraphs: spectral theory and topology;Mulas,2022
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Random maps with sociological flavor;Journal of Physics A: Mathematical and Theoretical;2024-05-13
2. Chemically inspired Erdős–Rényi hypergraphs;Journal of Mathematical Chemistry;2024-04-05
3. Framework to generate hypergraphs with community structure;Physical Review E;2024-03-19
4. Theory of percolation on hypergraphs;Physical Review E;2024-01-17
5. The magic of networks grown by redirection;Indian Journal of Physics;2023-12-18