IMT Institutional Repository: No conditions. Results ordered -Date Deposited. 2024-05-19T04:32:22ZEPrintshttp://eprints.imtlucca.it/images/logowhite.pnghttp://eprints.imtlucca.it/2018-03-09T13:47:11Z2018-03-09T13:47:11Zhttp://eprints.imtlucca.it/id/eprint/4040This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/40402018-03-09T13:47:11ZCovariance structure behind breaking of ensemble equivalence in random graphsFor 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 the canonical ensemble requires the constraint to be met only on average (`soft constraint'). It is known that breaking of ensemble equivalence may occur when the size of the random graph tends to infinity, signalled by a non-zero specific relative entropy of the two ensembles. In this paper we analyse a formula for the relative entropy of generic random discrete structures recently put forward by Squartini and Garlaschelli. We consider the case of random graphs with given degree sequence (configuration model) and show that this formula correctly predicts that the specific relative entropy in the dense regime is determined by the matrix of canonical covariances of the constraints. The formula also correctly predicts that an extra correction term is required in the sparse regime and the ultra-dense regime. We further show that the different expressions correspond to the degrees in the canonical ensemble being asymptotically Gaussian in the dense regime and asymptotically Poisson in the sparse and the ultra-dense regime, as we found in earlier work. In general, we show that the degrees follow a multivariate version of the Poisson- Binomial distribution in the canonical ensemble.Diego Garlaschellidiego.garlaschelli@imtlucca.itFrank den HollanderAndrea Roccaverde