Ensemble nonequivalence in random graphs with modular structure

DOI10.1088/1751-8113/50/1/015001zbMath1358.82014arXiv1603.08759OpenAlexW2325137483WikidataQ61387113 ScholiaQ61387113MaRDI QIDQ2965327

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

Publication date: 2 March 2017

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

zbMATH Keywords

microcanonical ensemblerandom graphconstraintscommunity structuremultiplex networkstochastic blockmodelequivalence versus non-equivalence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31) Statistical thermodynamics (82B30)

Related Items (7)

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 ⋮ Breaking of ensemble equivalence for dense random graphs under a single constraint ⋮ Ensemble equivalence for dense graphs ⋮ Asymptotic equivalence of probability measures and stochastic processes ⋮ Ground states for exponential random graphs

Cites Work

• Unnamed Item
• Low-temperature behaviour of social and economic networks
• Phase transitions in exponential random graphs
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Equivalence and nonequivalence of ensembles: thermodynamic, macrostate, and measure levels
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• The asymptotic number of non-negative integer matrices with given row and column sums
• The asymptotic number of labeled graphs with given degree sequences
• How likely is an LLD degree sequence to be graphical?
• Singularities in the entropy of asymptotically large simple graphs
• Estimating and understanding exponential random graph models
• Random Graphs and Complex Networks
• Phase transitions in a complex network
• Physics of Long-Range Interacting Systems
• Unbiased sampling of network ensembles
• Scale-Free Networks
• Nonequivalent statistical equilibrium ensembles and refined stability theorems for most probable flows
• A critical point for random graphs with a given degree sequence
• Gravitational instability of isothermal and polytropic spheres
• Analytical maximum-likelihood method to detect patterns in real networks
• The average distances in random graphs with given expected degrees
• Large deviation principles and complete equivalence and nonequivalence results for pure and mixed ensembles

This page was built for publication: Ensemble nonequivalence in random graphs with modular structure