Preferential Attachment as a Simpliciality-Enforcing Mechanism in Hypergraphs

Abstract

Higher-order networks, represented as hypergraphs, enable direct modeling of multi-body interactions of arbitrary size. Hypergraph representations of real-world systems have been observed to exhibit high \emph{simpliciality} --- the tendency for subsets of hyperedges to also appear as hyperedges --- yet the generative mechanisms responsible for this structure are poorly understood. We introduce a generalized preferential attachment hypergraph model in which both hyperedge size $Y_t$ and the number of new nodes per step $X_t$ are drawn from arbitrary distributions, and derive analytically, using a mean-field approximate master equation approach, that the stationary hyperdegree distribution follows a power law whose exponent depends only on the ratio $p = E[X_t]/E[Y_t]$, independent of the shapes of the underlying distributions. Crucially, both $X_t$ and $Y_t$ can be estimated directly from any timestamped hypergraph dataset via a backward-stepping procedure, enabling the model to be fit without parametric assumptions. Applying a nonlinear extension of the model to eight real-world hypergraph datasets, we find that the simplicial fraction increases monotonically with the strength of preferential attachment up to the gelation transition at $α> 1$, establishing preferential attachment as a simpliciality-enforcing mechanism.