Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
arXiv:1602.04110 · doi:10.1103/PhysRevE.93.062311
Abstract
Simplicial complexes are generalized network structures able to encode interactions occurring between more than two nodes. Simplicial complexes describe a large variety of complex interacting systems ranging from brain networks, to social and collaboration networks. Here we characterize the structure of simplicial complexes using their generalized degrees that capture fundamental properties of one, two, three or more linked nodes. Moreover we introduce the configuration model and the canonical ensemble of simplicial complexes, enforcing respectively the sequence of generalized degrees of the nodes and the sequence of the expected generalized degrees of the nodes. We evaluate the entropy of these ensembles, finding the asymptotic expression for the number of simplicial complexes in the configuration model. We provide the algorithms for the construction of simplicial complexes belonging to the configuration model and the canonical ensemble of simplicial complexes. We give an expression for the structural cutoff of simplicial complexes that for simplicial complexes of dimension reduces to the structural cutoff of simple networks. Finally we provide a numerical analysis of the natural correlations emerging in the configuration model of simplicial complexes without structural cutoff.
arXiv comment(16 pages, 6 figures)
References in corpus (34)
- Multilayer Networks
- The structure and dynamics of multilayer networks
- Why social networks are different from other types of networks
- Recommender Systems
- The statistical mechanics of networks
- Popularity versus Similarity in Growing Networks
- Emergence of a 4D World from Causal Quantum Gravity
- Reconstructing the Universe
- Entropy measures for complex networks: Toward an information theory of complex topologies
- Self-similarity of complex networks and hidden metric spaces
- Cut-offs and finite size effects in scale-free networks
- The entropy of network ensembles
- Random hypergraphs and their applications
- The entropy of randomized network ensembles
- Topological strata of weighted complex networks
- Assessing the relevance of node features for network structure
- Spacetime geometry from algebra: spin foam models for non-perturbative quantum gravity
- Cosmology from Group Field Theory Formalism for Quantum Gravity
- Efficient and exact sampling of simple graphs with given arbitrary degree sequence
- Topological data analysis of contagion maps for examining spreading processes on networks
- Network geometry with flavor: from complexity to quantum geometry
- Generalized Bose-Fermi statistics and structural correlations in weighted networks
- Interdisciplinary and physics challenges of Network Theory
- Emergent Complex Network Geometry
- Hypergraph topological quantities for tagged social networks
- Gibbs entropy of networks ensembles by cavity methods
- Entropies of complex networks with hierarchically constrained topologies
- Complex Quantum Network Geometries: Evolution and Phase Transitions
- Mesoscopic Structures Reveal the Network Between the Layers of Multiplex Datasets
- Constructing and sampling directed graphs with given degree sequences
- Immune networks: multi-tasking capabilities near saturation
- Exponential Random Simplicial Complexes
- Statistical Mechanics of Multi-Edge Networks
- The role of adjacency matrix degeneration in maximum entropy weighted network models
Cited by in corpus (83)
- Networks beyond pairwise interactions: structure and dynamics
- The physics of higher-order interactions in complex systems
- 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?
- Explosive higher-order Kuramoto dynamics on simplicial complexes
- Topological Signal Processing over Simplicial Complexes
- Random walks on hypergraphs
- 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
- Emergent Hyperbolic Network Geometry
- Higher-order motif analysis in hypergraphs
- Simplicial complexes and complex systems
- Higher-order simplicial synchronization of coupled topological signals
- Inference of hyperedges and overlapping communities in hypergraphs
- Higher-order percolation processes on multiplex hypergraphs
- Hypergraph reconstruction from network data
- Simplicial contagion in temporal higher-order networks
- Simplicial SIS model in scale-free uniform hypergraph
- Weighted Growing Simplicial Complexes
- Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks
- Construction of and efficient sampling from the simplicial configuration model
- Growing scale-free simplices
- Intralayer and interlayer synchronization in multiplex network with higher-order interactions
- Group interactions modulate critical mass dynamics in social convention
- Covering Problems and Core Percolations on Hypergraphs
- Global topological synchronization on simplicial and cell complexes
- The spectral dimension of simplicial complexes: a renormalization group theory
- Network Geometry and Complexity
- Hyperedge overlap drives explosive collective behaviors in systems with higher-order interactions
- Complex network view of evolving manifolds
- Consensus on simplicial complexes, or: The nonlinear simplicial Laplacian
- Dense Power-law Networks and Simplicial Complexes
- Percolation and Topological Properties of Temporal Higher-order Networks
- Synchronization of phase oscillators on complex hypergraphs
- Simplicial degree in complex networks. Applications of Topological Data Analysis to Network Science
- Spectral Detection of Simplicial Communities via Hodge Laplacians
- Social contagion on higher-order structures
- The higher-order spectrum of simplicial complexes: a renormalization group approach
- Hypergraph assortativity: a dynamical systems perspective
- Classical Information Theory of Networks
- Simplex2Vec embeddings for community detection in simplicial complexes
- Hyperlink communities in higher-order networks
- On the reorderability of node-filtered order complexes
- Geometry, Topology and Simplicial Synchronization
- Higher-Order Networks Representation and Learning: A Survey
- On the fate of the Hoop Conjecture in quantum gravity
- A framework to generate hypergraphs with community structure
- Random Simplicial Complexes: Models and Phenomena
- Aggregation models on hypergraphs
- Uncovering hidden dependency in weighted networks via information entropy
- The Stochastic complexity of spin models: Are pairwise models really simple?
- Atomic subgraphs and the statistical mechanics of networks
- The universality of physical images at relative timescales on multiplex networks
- Entropy rate of random walks on complex networks under stochastic resetting
- Quantum statistics in Network Geometry with Fractional Flavor
- Grand canonical ensembles of sparse networks and Bayesian inference
- Higher-order evolutionary dynamics with game transitions
- Influence of Asymmetric Parameters in Higher-Order Coupling With Bimodal Frequency Distribution
- Random Recursive Hypergraphs
- Impact of random and targeted disruptions on information diffusion during outbreaks
- Measuring dynamical systems on directed hyper-graphs
- Entropy-based models to randomize real-world hypergraphs
- Topological estimation of the latent geometry of a complex network
- Statistical physics of exchangeable sparse simple networks, multiplex networks and simplicial complexes
- Structure of international trade hypergraphs
- Impact of directionality on the emergence of Turing patterns on m-directed higher-order structures
- Signal processing on simplicial complexes
- Eigenvector localization in hypergraphs: pair-wise vs higher-order links
- The Atlas for the Aspiring Network Scientist
- Adaptive Epidemic Dynamics on Hypergraphs with Group-Level Immunization and Rewiring
- Gelation in input-driven aggregation
- Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks
- Uniformly sampling random directed hypergraphs with fixed degrees
- Relaxation dynamics of maximally clustered networks
- Construction of simplicial complexes with prescribed degree-size sequences
- Phase transitions for polyadic epidemic and voter models with multiscale groups
- Dynamical systems defined on simplicial complexes: symmetries, conjugacies, and invariant subspaces
- Discrimination universally determines reconstruction of multiplex networks