Construction of and efficient sampling from the simplicial configuration model
arXiv:1705.10298 · doi:10.1103/PhysRevE.96.032312
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.
arXiv comment6 pages, 4 figures
References in corpus (16)
- Finding and evaluating community structure in networks
- Epidemic processes in complex networks
- Random graphs with arbitrary degree distributions and their applications
- Control Principles of Complex Networks
- Properties of highly clustered networks
- Hierarchical structures of amorphous solids characterized by persistent homology
- Persistent homology analysis of protein structure, flexibility and folding
- Persistent Homology of Complex Networks
- Topological strata of weighted complex networks
- Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
- Quantifying randomness in real networks
- Network geometry with flavor: from complexity to quantum geometry
- Emergent Complex Network Geometry
- Exponential Random Simplicial Complexes
- On the K-theory of planar cuspical curves and a new family of polytopes
- Complex networks as an emerging property of hierarchical preferential attachment
Cited by in corpus (32)
- Networks beyond pairwise interactions: structure and dynamics
- Simplicial models of social contagion
- A roadmap for the computation of persistent homology
- 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 -Core Sequences: A New Null Model for Network Analysis
- The universality of physical images at relative timescales on multiplex networks
- FreSCo: Mining Frequent Patterns in Simplicial Complexes
- 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