26 citations · 37 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
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…