Random Recursive Hypergraphs
From MaRDI portal
Publication:6420546
DOI10.1088/1751-8121/ACCAC0zbMATH Open1512.05359arXiv2212.07371MaRDI QIDQ6420546FDOQ6420546
Authors: P. L. Krapivsky 
Publication date: 14 December 2022
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.
Random graphs (graph-theoretic aspects) (05C80) Bell and Stirling numbers (11B73) Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45) Bernoulli and Euler numbers and polynomials (11B68)
This page was built for publication: Random Recursive Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6420546)
