Breaking of ensemble equivalence in networks

Abstract

It is generally believed that, in the thermodynamic limit, the microcanonical description as a function of energy coincides with the canonical description as a function of temperature. However, various examples of systems for which the microcanonical and canonical ensembles are not equivalent have been identified. A complete theory of this intriguing phenomenon is still missing. Here we show that ensemble nonequivalence can manifest itself also in random graphs with topological constraints. We find that, while graphs with a given number of links are ensemble-equivalent, graphs with a given degree sequence are not. This result holds irrespective of whether the energy is nonadditive (as in unipartite graphs) or additive (as in bipartite graphs). In contrast with previous expectations, our results show that: (1) physically, nonequivalence can be induced by an extensive number of local constraints, and not necessarily by long-range interactions or nonadditivity; (2) mathematically, nonquivalence is determined by a different large-deviation behaviour of microcanonical and canonical probabilities for a single microstate, and not necessarily for almost all microstates. The latter criterion, which is entirely local, is not restricted to networks and holds in general.

Final version accepted for publication on Physical Review Letters

References in corpus (9)

• The large deviation approach to statistical mechanics
• Statistical mechanics and dynamics of solvable models with long-range interactions
• Maximum likelihood: extracting unbiased information from complex networks
• Randomizing bipartite networks: the case of the World Trade Web
• Equivalence and nonequivalence of ensembles: Thermodynamic, macrostate, and measure levels
• An Introduction to the Thermodynamic and Macrostate Levels of Nonequivalent Ensembles
• Thermodynamic versus statistical nonequivalence of ensembles for the mean-field Blume-Emery-Griffiths model
• Unbiased sampling of network ensembles
• Ensemble inequivalence in random graphs

Cited by in corpus (40)

• Social physics
• The Statistical Physics of Real-World Networks
• Nonparametric Bayesian inference of the microcanonical stochastic block model
• Clustering implies geometry in networks
• Comparing Alternatives to the Fixed Degree Sequence Model for Extracting the Backbone of Bipartite Projections
• Gaussian concentration bound and Ensemble equivalence in generic quantum many-body systems including long-range interaction
• Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution
• Ensemble nonequivalence in random graphs with modular structure
• Meta-validation of bipartite network projections
• The ambiguity of nestedness under soft and hard constraints
• Irreducible network backbones: unbiased graph filtering via maximum entropy
• Classical Information Theory of Networks
• Fluctuating ecological networks: a synthesis of maximum-entropy approaches for pattern detection and process inference
• Strong ensemble nonequivalence in systems with local constraints
• Pattern detection in bipartite networks: a review of terminology, applications and methods
• fastball: A fast algorithm to sample bipartite graphs with fixed degree sequences
• Random Simplicial Complexes: Models and Phenomena
• Continuum of classical-field ensembles from canonical to grand canonical and the onset of their equivalence
• Covariance structure behind breaking of ensemble equivalence in random graphs
• Entropy rate of random walks on complex networks under stochastic resetting
• Entropy of labeled versus unlabeled networks
• Latent Poisson models for networks with heterogeneous density
• Hamiltonian Dynamics of Preferential Attachment
• Macrostate equivalence of two general ensembles and specific relative entropies
• Sparse power-law network model for reliable statistical predictions based on sampled data
• Ensemble nonequivalence and Bose-Einstein condensation in weighted networks
• Thermodynamics of structure-forming systems
• A spectral signature of breaking of ensemble equivalence for constrained random graphs
• Asymptotic equivalence of probability measures and stochastic processes
• On the fluctuations of the number of atoms in the condensate
• Reconciling econometrics with continuous maximum-entropy network models
• Characterizing spatial point processes by percolation transitions
• Description length of canonical and microcanonical models
• Ensemble inequivalence and absence of quasi-stationary states in long-range random networks
• Ensemble inequivalence and phase transitions in unlabeled networks
• Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
• Thermodynamics of the Minimum Description Length on Community Detection
• Statistical field theory of random graphs with prescribed degrees
• Identifying maximal sets of significantly interacting nodes in higher-order networks
• Italian Twitter semantic network during the Covid-19 epidemic