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

DOI10.1017/jpr.2022.127zbMath1530.05172arXiv2107.04351OpenAlexW3180623716MaRDI QIDQ6189095

Maarten Markering, W. Th. F. den Hollander

Publication date: 12 January 2024

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

graphonreplica symmetryGibbs ensemblevariational representationmaximal eigenvaluesbreaking of ensemble equivalenceconstrained random graphrelative etropy

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Large deviations (60F10) Density (toughness, etc.) (05C42)

Cites Work

• Phase transitions in exponential random graphs
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• The large deviation principle for the Erdős-Rényi random graph
• Szemerédi's lemma for the analyst
• Equivalence and nonequivalence of ensembles: thermodynamic, macrostate, and measure levels
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Covariance structure behind breaking of ensemble equivalence in random graphs
• Ensemble equivalence for dense graphs
• A spectral signature of breaking of ensemble equivalence for constrained random graphs
• Differential calculus on graphon space
• Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
• Estimating and understanding exponential random graph models
• Ensemble nonequivalence in random graphs with modular structure
• On replica symmetry of large deviations in random graphs
• Information Theory and Statistical Mechanics
• Maximum-Entropy Networks