Is breaking of ensemble equivalence monotone in the number of constraints?
From MaRDI portal
Publication:1629116
DOI10.1016/j.indag.2018.08.001zbMath1410.82010arXiv1807.02791OpenAlexW2964303848WikidataQ59760541 ScholiaQ59760541MaRDI QIDQ1629116
Publication date: 11 December 2018
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.02791
Random graphs (graph-theoretic aspects) (05C80) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31) Statistical thermodynamics (82B30)
Cites Work
- Unnamed Item
- Equivalence and nonequivalence of ensembles: thermodynamic, macrostate, and measure levels
- Ensemble equivalence for dense graphs
- Asymptotic equivalence of probability measures and stochastic processes
- Random Graphs and Complex Networks
- Ensemble nonequivalence in random graphs with modular structure
- Unbiased sampling of network ensembles
- Maximum-Entropy Networks
- The number of graphs and a random graph with a given degree sequence