Covariance structure behind breaking of ensemble equivalence in random graphs

DOI10.1007/s10955-018-2114-xzbMath1403.60016arXiv1711.04273OpenAlexW3105181368WikidataQ59760540 ScholiaQ59760540MaRDI QIDQ1633964

Andrea Roccaverde, Diego Garlaschelli, W. Th. F. den Hollander

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.04273

zbMATH Keywords

relative entropycanonical ensemblemicrocanonical ensemblecovariance matrixrandom graphtopological constraintsequivalence vs. nonequivalence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Complex networks: structure and functionality ⋮ Breaking of ensemble equivalence for dense random graphs under a single constraint ⋮ A spectral signature of breaking of ensemble equivalence for constrained random graphs

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
• The smallest eigenvalue for reversible Markov chains
• 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