Gibbs entropy of networks ensembles by cavity methods

Abstract

The Gibbs entropy of a microcanonical network ensemble is the logarithm of the number of network configurations compatible with a set of hard constraints. This quantity characterizes the level of order and randomness encoded in features of a given real network. Here we show how to relate this entropy to large deviations of conjugated canonical ensembles. We derive exact expression for this correspondence using the cavity methods for some hard constraints.

8 pages

References in corpus (10)

• Community detection in graphs
• Critical phenomena in complex networks
• Random graphs with clustering
• Entropy measures for complex networks: Toward an information theory of complex topologies
• The entropy of network ensembles
• The entropy of randomized network ensembles
• The entropic origin of disassortativity in complex networks
• Entropies of complex networks with hierarchically constrained topologies
• Random acyclic networks
• On the number of circuits in random graphs

Cited by in corpus (28)

• Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap
• Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
• Sparse graphs using exchangeable random measures
• The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
• Entropy of stochastic blockmodel ensembles
• Unbiased sampling of network ensembles
• Multiplex networks with heterogeneous activities of the nodes
• Complex Quantum Networks: a Topical Review
• Entropy distribution and condensation in random networks with a given degree distribution
• Ensemble nonequivalence in random graphs with modular structure
• Classical Information Theory of Networks
• Entropy rate of non-equilibrium growing networks
• The scaling of the minimum sum of edge lengths in uniformly random trees
• Grand canonical ensembles of sparse networks and Bayesian inference
• Entropy of labeled versus unlabeled networks
• Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness
• Controlling network ensembles
• Latent Poisson models for networks with heterogeneous density
• Entropy rate of random walks on complex networks under stochastic resetting
• Duality between predictability and reconstructability in complex systems
• Quantum entropy couples matter with geometry
• Sparse power-law network model for reliable statistical predictions based on sampled data
• Statistical physics of exchangeable sparse simple networks, multiplex networks and simplicial complexes
• Characterizing spatial point processes by percolation transitions
• Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks
• Ensemble inequivalence and phase transitions in unlabeled networks
• Entropy of Random Geometric Graphs in High and Low Dimensions
• Network Entropy measures applied to different systemic perturbations of cell basal state