Growing scale-free simplices
K. Kovalenko, I. Sendi\~na-Nadal, N. Khalil, A. Dainiak, D. Musatov,, A.M. Raigorodskii, K. Alfaro-Bittner, B. Barzel, S. Boccaletti

TL;DR
This paper introduces a flexible generative model for scale-free simplicial complexes of order two, capturing higher-order interactions beyond pairwise links, with controllable degree distributions, advancing understanding of complex systems with multi-component interactions.
Contribution
It presents a novel, analytically tractable model for growing simplicial complexes that reproduces key statistical properties observed in real-world higher-order network data.
Findings
The model produces scale-free degree distributions.
It allows control over the scaling exponents.
The model can generate complexes with desired statistical features.
Abstract
The past two decades have seen significant successes in our understanding of complex networked systems, from the mapping of real-world social, biological and technological networks to the establishment of generative models recovering their observed macroscopic patterns. These advances, however, are restricted to pairwise interactions, captured by dyadic links, and provide limited insight into higher-order structure, in which a group of several components represents the basic interaction unit. Such multi-component interactions can only be grasped through simplicial complexes, which have recently found applications in social and biological contexts, as well as in engineering and brain science. What, then, are the generative models recovering the patterns observed in real-world simplicial complexes? Here we introduce, study, and characterize a model to grow simplicial complexes of order…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
