Ensemble equivalence for dense graphs

DOI10.1214/18-EJP135zbMath1387.05240arXiv1703.08058WikidataQ61387116 ScholiaQ61387116MaRDI QIDQ1748915

N. J. Starreveld, Andrea Roccaverde, W. Th. F. den Hollander, M. R. H. Mandjes

Publication date: 15 May 2018

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

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

zbMATH Keywords

graphonrelative entropycanonical ensemblemicrocanonical ensembleconstraintrandom graphensemble equivalencevariational representation

Mathematics Subject Classification ID

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

Related Items (10)

Complex networks: structure and functionality ⋮ Is breaking of ensemble equivalence monotone in the number of constraints? ⋮ Covariance structure behind breaking of ensemble equivalence in random graphs ⋮ Large deviation for uniform graphs with given degrees ⋮ Breaking of ensemble equivalence for dense random graphs under a single constraint ⋮ Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph ⋮ A large deviation principle for the Erdős-Rényi uniform random graph ⋮ A spectral signature of breaking of ensemble equivalence for constrained random graphs ⋮ Ground states for exponential random graphs ⋮ A betweenness structural entropy of complex networks

Cites Work

• Unnamed Item
• Phase transitions in exponential random graphs
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Asymptotic structure and singularities in constrained directed graphs
• Random graphs with a given degree sequence
• The large deviation principle for the Erdős-Rényi random graph
• Mixing time of exponential random graphs
• Limits of dense graph sequences
• Equivalence and nonequivalence of ensembles: thermodynamic, macrostate, and measure levels
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Singularities in the entropy of asymptotically large simple graphs
• Differential calculus on graphon space
• Asymptotics for sparse exponential random graph models
• Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
• Asymptotic structure of constrained exponential random graph models
• Multipodal structure and phase transitions in large constrained graphs
• Estimating and understanding exponential random graph models
• Critical phenomena in exponential random graphs
• Large deviations and exact asymptotics for constrained exponential random graphs
• Nonlinear large deviations
• An introduction to large deviations for random graphs
• Random Graphs and Complex Networks
• Phase transitions in a complex network
• Ensemble nonequivalence in random graphs with modular structure
• On replica symmetry of large deviations in random graphs
• Information Theory and Statistical Mechanics
• On the asymptotics of constrained exponential random graphs
• Asymptotic Structure of Graphs with the Minimum Number of Triangles

This page was built for publication: Ensemble equivalence for dense graphs