Construction of and efficient sampling from the simplicial configuration model

Abstract

Simplicial complexes are now a popular alternative to networks when it comes to describing the structure of complex systems, primarily because they encode multi-node interactions explicitly. With this new description comes the need for principled null models that allow for easy comparison with empirical data. We propose a natural candidate, the simplicial configuration model. The core of our contribution is an efficient and uniform Markov chain Monte Carlo sampler for this model. We demonstrate its usefulness in a short case study by investigating the topology of three real systems and their randomized counterparts (using their Betti numbers). For two out of three systems, the model allows us to reject the hypothesis that there is no organization beyond the local scale.

6 pages, 4 figures

References in corpus (3)

• Persistent homology analysis of protein structure, flexibility and folding
• Persistent Homology of Complex Networks
• Emergent Complex Network Geometry

Cited by in corpus (31)

• Networks beyond pairwise interactions: structure and dynamics
• Simplicial models of social contagion
• Dynamics on higher-order networks: A review
• The Statistical Physics of Real-World Networks
• What are higher-order networks?
• Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian
• Multiorder Laplacian for synchronization in higher-order networks
• The effect of heterogeneity on hypergraph contagion models
• Simplicial Activity Driven Model
• Inference of hyperedges and overlapping communities in hypergraphs
• Hypergraph reconstruction from network data
• Growing scale-free simplices
• Network Geometry and Complexity
• Learning physical properties of anomalous random walks using graph neural networks
• Dense Power-law Networks and Simplicial Complexes
• Percolation and Topological Properties of Temporal Higher-order Networks
• Spectral Detection of Simplicial Communities via Hodge Laplacians
• Hypergraph assortativity: a dynamical systems perspective
• Hyperlink communities in higher-order networks
• Higher-Order Networks Representation and Learning: A Survey
• A framework to generate hypergraphs with community structure
• STruD: Truss Decomposition of Simplicial Complexes
• Random Simplicial Complexes: Models and Phenomena
• Dynamic Hidden-Variable Network Models
• Random Graphs with Prescribed $K$-Core Sequences: A New Null Model for Network Analysis
• FreSCo: Mining Frequent Patterns in Simplicial Complexes
• The universality of physical images at relative timescales on multiplex networks
• The Atlas for the Aspiring Network Scientist
• Uniformly sampling random directed hypergraphs with fixed degrees
• Relaxation dynamics of maximally clustered networks
• Construction of simplicial complexes with prescribed degree-size sequences