The entropy of network ensembles
Ginestra Bianconi

TL;DR
This paper introduces a statistical mechanics framework to analyze the entropy of various network ensembles, including those with complex features like community structure and spatial dependencies, providing insights into their typical configurations.
Contribution
It generalizes network entropy concepts to diverse ensembles, including microcanonical and canonical, and characterizes the structural entropy of degree-constrained networks, especially scale-free ones.
Findings
Scale-free networks have small structural entropy.
Scale-free networks are the most probable degree distribution given their entropy.
The framework applies to undirected, directed, and weighted networks.
Abstract
In this paper we generalize the concept of random networks to describe networks with non trivial features by a statistical mechanics approach. This framework is able to describe ensembles of undirected, directed as well as weighted networks. These networks might have not trivial community structure or, in the case of networks embedded in a given space, non trivial distance dependence of the link probability. These ensembles are characterized by their entropy which evaluate the cardinality of networks in the ensemble. The general framework we present in this paper is able to describe microcanonical ensemble of networks as well as canonical or hidden variables network ensemble with significant implication for the formulation of network constructing algorithms. Moreover in the paper we define and and characterize in particular the "structural entropy", i.e. the entropy of the ensembles of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
