Ensemble nonequivalence in random graphs with modular structure
From MaRDI portal
Abstract: Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must be met by every graph, soft constraints must be met only on average, subject to maximal entropy. In Squartini et al. (2015) it was shown that ensembles of random graphs are non-equivalent when the degrees of the nodes are constrained, in the sense of a non-zero limiting specific relative entropy as the number of nodes diverges. In that paper, the nodes were placed either on a single layer (uni-partite graphs) or on two layers (bi-partite graphs). In the present paper we consider an arbitrary number of intra-connected and inter-connected layers, thus allowing for modular graphs with a multi-partite, multiplex, block-model or community structure. We give a full classification of ensemble equivalence, proving that breakdown occurs if and only if the number of local constraints (i.e., the number of constrained degrees) is extensive in the number of nodes, irrespective of the layer structure. In addition, we derive a formula for the specific relative entropy and provide an interpretation of this formula in terms of Poissonisation of the degrees.
Recommendations
- Modularity in several random graph models
- Modularity of Erdős-Rényi random graphs
- Modularity of Erdős-Rényi random graphs
- Covariance structure behind breaking of ensemble equivalence in random graphs
- A spectral signature of breaking of ensemble equivalence for constrained random graphs
- An ensemble of random graphs with identical degree distribution
- Random graph ensembles with many short loops
- Entropies of tailored random graph ensembles: bipartite graphs, generalized degrees, and node neighbourhoods
- On the equivalence between random graph models
- Ensemble inequivalence and absence of quasi-stationary states in long-range random networks
Cites work
- A critical point for random graphs with a given degree sequence
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Analytical maximum-likelihood method to detect patterns in real networks
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Complex networks from a physical perspective
- Equivalence and nonequivalence of ensembles: thermodynamic, macrostate, and measure levels
- Estimating and understanding exponential random graph models
- Gravitational instability of isothermal and polytropic spheres
- How likely is an LLD degree sequence to be graphical?
- Large deviation principles and complete equivalence and nonequivalence results for pure and mixed ensembles
- Low-temperature behaviour of social and economic networks
- Nonequivalent statistical equilibrium ensembles and refined stability theorems for most probable flows
- Phase transitions in a complex network
- Phase transitions in exponential random graphs
- Physics of long-range interacting systems
- Random graphs and complex networks. Volume 1
- Scale-Free Networks
- Singularities in the entropy of asymptotically large simple graphs
- The asymptotic number of labeled graphs with given degree sequences
- The asymptotic number of non-negative integer matrices with given row and column sums
- The average distances in random graphs with given expected degrees
- Unbiased sampling of network ensembles
Cited in
(9)- Is breaking of ensemble equivalence monotone in the number of constraints?
- Covariance structure behind breaking of ensemble equivalence in random graphs
- Ensemble equivalence for dense graphs
- Asymptotic equivalence of probability measures and stochastic processes
- A spectral signature of breaking of ensemble equivalence for constrained random graphs
- Complex networks: structure and functionality
- Entropies of tailored random graph ensembles: bipartite graphs, generalized degrees, and node neighbourhoods
- Ground states for exponential random graphs
- Breaking of ensemble equivalence for dense random graphs under a single constraint
This page was built for publication: Ensemble nonequivalence in random graphs with modular structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965327)
