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.

(25 pages, 1 figure)

References in corpus (13)

• The structure and dynamics of multilayer networks
• Hyperbolic Geometry of Complex Networks
• The physics of higher-order interactions in complex systems
• The entropy of network ensembles
• Random hypergraphs and their applications
• Maximum likelihood: extracting unbiased information from complex networks
• Efficient and exact sampling of simple graphs with given arbitrary degree sequence
• Spectral entropies as information-theoretic tools for complex network comparison
• Entropies of complex networks with hierarchically constrained topologies
• Statistical physics of complex information dynamics
• Correlations in complex networks under attack
• Entropic dynamics on Gibbs statistical manifolds
• Atomic subgraphs and the statistical mechanics of networks

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