Assortativeness and information in scale-free networks

We analyze Shannon information of scale-free networks in terms of their assortativeness, and identify classes of networks according to the dependency of the joint remaining degree distribution on the assortativeness. We conjecture that these classes comprise minimalistic and maximalistic networks in terms of Shannon information. For the studied classes, the information is shown to depend non-linearly on the absolute value of the assortativeness, with the dominant term of the relationship being a power-law. We exemplify this dependency using a range of real-world networks. Optimization of scale-free networks according to information they contain depends on the landscape of parameters’ search-space, and we identify two regions of interest: a slope region and a stability region. In the slope region, there is more freedom to generate and evaluate candidate networks since the information content can be changed easily by modifying only the assortativeness, while even a small change in the power-law’s scaling exponent brings a reward in a higher rate of information change. This feature may explain why the exponents of real-world scale-free networks are within a certain range, defined by the slope and stability regions.

[1]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[2]  R. A. Leibler,et al.  On Information and Sufficiency , 1951 .

[3]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[4]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[5]  Schreiber,et al.  Measuring information transfer , 2000, Physical review letters.

[6]  J. Hopcroft,et al.  Are randomly grown graphs really random? , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[8]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[9]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Alessandro Vespignani,et al.  Cut-offs and finite size effects in scale-free networks , 2003, cond-mat/0311650.

[11]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[12]  Jan Baumbach,et al.  Coryneregnet 4.0 – a Reference Database for Corynebacterial Gene Regulatory Networks , 2007 .

[13]  R. Guimerà,et al.  Classes of complex networks defined by role-to-role connectivity profiles. , 2007, Nature physics.

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

[15]  Albert Y. Zomaya,et al.  Local assortativeness in scale-free networks , 2008 .

[16]  Albert Y. Zomaya,et al.  Local information transfer as a spatiotemporal filter for complex systems. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.