arXiv · 1001.4717
Gibbs entropy of networks ensembles by cavity methods
Abstract
The Gibbs entropy of a microcanonical network ensemble is the logarithm of the number of network configurations compatible with a set of hard constraints. This quantity characterizes the level of order and randomness encoded in features of a given real network. Here we show how to relate this entropy to large deviations of conjugated canonical ensembles. We derive exact expression for this correspondence using the cavity methods for some hard constraints.
Explore related subjects
Keep this discovery
Kartik Anand, Ginestra Bianconi. 2010-01-26. Gibbs entropy of networks ensembles by cavity methods. https://doi.org/10.1103/physreve.82.011116
Cite the original work for its findings. Save a collection to share your selection of sources.