# Breaking of Ensemble Equivalence in Networks.

@article{Squartini2015BreakingOE, title={Breaking of Ensemble Equivalence in Networks.}, author={Tiziano Squartini and Joey de Mol and Frank den Hollander and Diego Garlaschelli}, journal={Physical review letters}, year={2015}, volume={115 26}, pages={ 268701 } }

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…

## 51 Citations

### Ensemble nonequivalence in random graphs with modular structure

- Mathematics
- 2016

Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in…

### Ensemble inequivalence and absence of quasi-stationary states in long-range random networks

- Physics
- 2016

Ensemble inequivalence has been previously displayed only for long-range interacting systems with non-extensive energy. In order to perform the thermodynamic limit, such systems require an…

### Strong ensemble nonequivalence in systems with local constraints

- PhysicsNew Journal of Physics
- 2022

The asymptotic equivalence of canonical and microcanonical ensembles is a central concept in statistical physics, with important consequences for both theoretical research and practical applications.…

### Covariance Structure Behind Breaking of Ensemble Equivalence in Random Graphs

- Computer Science, MathematicsJournal of Statistical Physics
- 2018

This paper analyses a formula for the relative entropy of generic discrete random structures recently put forward by Squartini and Garlaschelli, and shows that in the dense regime this formula correctly predicts that the specific relative entropy is determined by the scaling of the determinant of the matrix of canonical covariances of the constraints.

### Is breaking of ensemble equivalence monotone in the number of constraints?

- Computer ScienceIndagationes Mathematicae
- 2019

### A spectral signature of breaking of ensemble equivalence for constrained random graphs

- Computer ScienceElectronic Communications in Probability
- 2021

A key tool in the analysis is a transfer method that uses relative entropy to determine whether probabilistic estimates can be carried over from the canonical ensemble to the microcanonical ensemble, and illustrates how breaking of ensemble equivalence may prevent this from being possible.

### Breaking of ensemble equivalence for dense random graphs under a single constraint

- Computer Science
- 2021

This paper establishes BEE for a third class: dense random graphs with a single constraint, namely, on the density of a given ﬁnite simple graph and shows that BEE occurs only in a certain range of choices for the density and the number of edges of the simple graph, which is referred to as the BEE-phase.

### Classical information theory of networks

- Computer ScienceJournal of Physics: Complexity
- 2020

This work introduces a novel classical network ensemble satisfying a set of soft constraints and finds the optimal distribution of the constraints for this ensemble and studies spatially embedded networks finding that the interactions between nodes naturally lead to non-uniform spread of nodes in the embedding space, leading to a fractal distribution of nodes.

### Hamiltonian dynamics of preferential attachment

- Computer ScienceArXiv
- 2015

The dynamics of networks evolving according to preferential attachment (PA), known to approximate well the large-scale growth dynamics of a variety of real networks, are studied and it is shown that this dynamics is Hamiltonian, thus casting the study of complex networks dynamics to the powerful canonical formalism.

### Equivalence and Nonequivalence of Ensembles: Thermodynamic, Macrostate, and Measure Levels

- Physics
- 2015

We present general and rigorous results showing that the microcanonical and canonical ensembles are equivalent at all three levels of description considered in statistical mechanics—namely,…

## References

SHOWING 1-10 OF 60 REFERENCES

### Equivalence and Nonequivalence of Ensembles: Thermodynamic, Macrostate, and Measure Levels

- Physics
- 2015

We present general and rigorous results showing that the microcanonical and canonical ensembles are equivalent at all three levels of description considered in statistical mechanics—namely,…

### Nonequivalent statistical equilibrium ensembles and refined stability theorems for most probable flows

- Environmental Science
- 2000

Statistical equilibrium models of coherent structures in two-dimensional and barotropic quasi-geostrophic turbulence are formulated using canonical and microcanonical ensembles, and the equivalence…

### Analytical maximum-likelihood method to detect patterns in real networks

- Computer Science
- 2011

This work proposes a fast method that allows one to obtain expectation values and standard deviations of any topological property analytically across the entire graph ensemble, for any binary, weighted, directed or undirected network.

### Inequivalence of ensembles in a system with long-range interactions.

- PhysicsPhysical review letters
- 2001

The global phase diagram of the infinite-range Blume-Emery-Griffiths model is studied both in the canonical and in the microcanonical ensembles to find that below the tricritical point, when the canonical transition is first order, the phase diagrams of the two ensemble disagree.

### Discrete math = 離散数学

- Mathematics
- 2004

What is discrete math? • The real numbers are continuous in the senses that: * between any two real numbers there is a real number • The integers do not share this property. In this sense the…

### Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2)

- MathematicsComb.
- 1991

The method used is a switching argument recently used by us to uniformly generate random graphs with given degree sequences to determine the asymptotic number of unlabelled graphs with a given degree sequence.