Entropy of network ensembles.

In this paper we generalize the concept of random networks to describe network ensembles with nontrivial features by a statistical mechanics approach. This framework is able to describe undirected and directed network ensembles as well as weighted network ensembles. These networks might have nontrivial community structure or, in the case of networks embedded in a given space, they might have a link probability with a nontrivial dependence on the distance between the nodes. These ensembles are characterized by their entropy, which evaluates the cardinality of networks in the ensemble. In particular, in this paper we define and evaluate the structural entropy, i.e., the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence. We stress the apparent paradox that scale-free degree distributions are characterized by having small structural entropy while they are so widely encountered in natural, social, and technological complex systems. We propose a solution to the paradox by proving that scale-free degree distributions are the most likely degree distribution with the corresponding value of the structural entropy. Finally, the general framework we present in this paper is able to describe microcanonical ensembles of networks as well as canonical or hidden-variable network ensembles with significant implications for the formulation of network-constructing algorithms.

[1]  Solar Radiation Temperatures , 1871, Nature.

[2]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[3]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[4]  Ritort.  Glassiness in a Model without Energy Barriers. , 1995, Physical review letters.

[5]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[6]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[7]  Bernd Blasius,et al.  Ecology: Nonlinearity and the Moran effect , 2000, Nature.

[8]  Z. Burda,et al.  Statistical ensemble of scale-free random graphs. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[10]  K. Sneppen,et al.  Specificity and Stability in Topology of Protein Networks , 2002, Science.

[11]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[12]  B. Söderberg.  General formalism for inhomogeneous random graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Johannes Berg,et al.  Correlated random networks. , 2002, Physical review letters.

[14]  Sergey N. Dorogovtsev,et al.  Principles of statistical mechanics of random networks , 2002, ArXiv.

[15]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[16]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[17]  R. Pastor-Satorras,et al.  Class of correlated random networks with hidden variables. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  A. Arenas,et al.  Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  M. Newman,et al.  Solution of the two-star model of a network. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[22]  Sergey N. Dorogovtsev,et al.  K-core Organization of Complex Networks , 2005, Physical review letters.

[23]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[24]  Z. Burda,et al.  Homogeneous complex networks , 2005, cond-mat/0502124.

[25]  Paul L. Krapivsky,et al.  Transition from small to large world in growing networks , 2007, ArXiv.

[26]  E A Leicht,et al.  Mixture models and exploratory analysis in networks , 2006, Proceedings of the National Academy of Sciences.

[27]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[28]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[29]  Ginestra Bianconi.  A statistical mechanics approach for scale-free networks and finite-scale networks. , 2007, Chaos.

[30]  Vito Latora,et al.  Entropy rate of diffusion processes on complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  G. Bianconi.  The entropy of randomized network ensembles , 2007, 0708.0153.

[32]  A. Coolen,et al.  Entropies of complex networks with hierarchically constrained topologies. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Adilson E Motter,et al.  Local structure of directed networks. , 2007, Physical review letters.

[34]  D. Garlaschelli,et al.  Maximum likelihood: extracting unbiased information from complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.