Statistical physics of exchangeable sparse simple networks, multiplex networks and simplicial complexes

Abstract

Exchangeability is a desired statistical property of network ensembles requiring their invariance upon relabelling of the nodes. However combining sparsity of network ensembles with exchangeability is challenging. Here we propose a statistical physics framework and a Metropolis-Hastings algorithm defining exchangeable sparse network ensembles. The model generates networks with heterogeneous degree distributions by enforcing only global constraints while existing (non exchangeable) exponential random graphs enforce an extensive number of local constraints. This very general theoretical framework to describe exchangeable networks is here first formulated for uncorrelated simple networks and then it is extended to treat simple networks with degree correlations, directed networks, bipartite networks and generalized network structures including multiplex networks and simplicial complexes. In particular here we formulate and treat both uncorrelated and correlated exchangeable ensembles of simplicial complexes using statistical mechanics approaches.

arXiv comment(25 pages, 1 figure)

References in corpus (44)

• Emergence of scaling in random networks
• The structure and dynamics of multilayer networks
• Specificity and stability in topology of protein networks
• Networks beyond pairwise interactions: structure and dynamics
• Dynamical and correlation properties of the Internet
• Hyperbolic Geometry of Complex Networks
• The physics of higher-order interactions in complex systems
• Large-scale topological and dynamical properties of Internet
• The statistical mechanics of networks
• Patterns of link reciprocity in directed networks
• The Statistical Physics of Real-World Networks
• Entropy measures for complex networks: Toward an information theory of complex topologies
• Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap
• The entropy of network ensembles
• Random hypergraphs and their applications
• Hierarchical Block Structures and High-resolution Model Selection in Large Networks
• Weighted Multiplex Networks
• The origin of degree correlations in the Internet and other networks
• Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
• Statistical mechanics of the random K-SAT model
• Maximum likelihood: extracting unbiased information from complex networks
• Quantifying randomness in real networks
• Sparse graphs using exchangeable random measures
• Efficient and exact sampling of simple graphs with given arbitrary degree sequence
• Solution of the 2-star model of a network
• Spectral entropies as information-theoretic tools for complex network comparison
• Entropy of stochastic blockmodel ensembles
• Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting networks ensembles
• Gibbs entropy of networks ensembles by cavity methods
• Entropies of complex networks with hierarchically constrained topologies
• Constructing and sampling directed graphs with given degree sequences
• Statistical physics of complex information dynamics
• Exponential Random Simplicial Complexes
• Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
• Complexity Measures from Interaction Structures
• Exact sampling of graphs with prescribed degree correlations
• Reducing Degeneracy in Maximum Entropy Models of Networks
• Statistical Mechanics of Multi-Edge Networks
• Correlations in complex networks under attack
• Classical Information Theory of Networks
• Entropic dynamics on Gibbs statistical manifolds
• Atomic subgraphs and the statistical mechanics of networks
• Algorithmic complexity of multiplex networks
• Sparse power-law network model for reliable statistical predictions based on sampled data

Cited by in corpus (5)

• The theory of percolation on hypergraphs
• The nature of hypergraph $k$-core percolation problems
• Grand canonical ensembles of sparse networks and Bayesian inference
• Entropy of labeled versus unlabeled networks
• Entropy-based models to randomize real-world hypergraphs