  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.
