26 citations · 37 across the 4 of their papers we have counts for
5 papers
Is breaking of ensemble equivalence monotone in the number of constraints?
Andrea Roccaverde
Breaking of ensemble equivalence between the microcanonical ensemble and the canonical ensemble may occur for random graphs whose size tends to infinity, and is signaled by a non-z…
Breaking of ensemble equivalence for perturbed Erdős-Rényi random graphs
F. den Hollander, M. Mandjes, A. Roccaverde +1
In [18] we analysed a simple undirected random graph subject to constraints on the total number of edges and the total number of triangles. We considered the dense regime in which…
Covariance structure behind breaking of ensemble equivalence in random graphs
Diego Garlaschelli, Frank den Hollander, Andrea Roccaverde
For a random graph subject to a topological constraint, the microcanonical ensemble requires the constraint to be met by every realisation of the graph (`hard constraint'), while t…
Ensemble equivalence for dense graphs
F. den Hollander, M. Mandjes, A. Roccaverde +1
In this paper we consider a random graph on which topological restrictions are imposed, such as constraints on the total number of edges, wedges, and triangles. We work in the dens…
Ensemble nonequivalence in random graphs with modular structure
Diego Garlaschelli, Frank den Hollander, Andrea Roccaverde
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently s…