Structure of shells in complex networks.

We define shell l in a network as the set of nodes at distance l with respect to a given node and define rl as the fraction of nodes outside shell l . In a transport process, information or disease usually diffuses from a random node and reach nodes shell after shell. Thus, understanding the shell structure is crucial for the study of the transport property of networks. We study the statistical properties of the shells of a randomly chosen node. For a randomly connected network with given degree distribution, we derive analytically the degree distribution and average degree of the nodes residing outside shell l as a function of rl. Further, we find that rl follows an iterative functional form rl=phi(rl-1) , where phi is expressed in terms of the generating function of the original degree distribution of the network. Our results can explain the power-law distribution of the number of nodes Bl found in shells with l larger than the network diameter d , which is the average distance between all pairs of nodes. For real-world networks the theoretical prediction of rl deviates from the empirical rl. We introduce a network correlation function c(rl) identical with rl/phi(rl-1) to characterize the correlations in the network, where rl is the empirical value and phi(rl-1) is the theoretical prediction. c(rl)=1 indicates perfect agreement between empirical results and theory. We apply c(rl) to several model and real-world networks. We find that the networks fall into two distinct classes: (i) a class of poorly connected networks with c(rl)>1 , where a larger (smaller) fraction of nodes resides outside (inside) distance l from a given node than in randomly connected networks with the same degree distributions. Examples include the Watts-Strogatz model and networks characterizing human collaborations such as citation networks and the actor collaboration network; (ii) a class of well-connected networks with c(rl)<1 . Examples include the Barabási-Albert model and the autonomous system Internet network.

[1]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[2]  S. Dubuc Problèmes relatifs à l'itération de fonctions suggérés par les processus en cascade , 1971 .

[3]  Béla Bollobás,et al.  Random Graphs , 1985 .

[4]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[7]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[8]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[9]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

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

[12]  M. Newman Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  H. Stanley,et al.  Optimal paths in disordered complex networks. , 2003, Physical review letters.

[14]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[15]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

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

[17]  Aravind Srinivasan,et al.  Modelling disease outbreaks in realistic urban social networks , 2004, Nature.

[18]  Alessandro Vespignani,et al.  Evolution and Structure of the Internet: A Statistical Physics Approach , 2004 .

[19]  Alessandro Vespignani,et al.  Evolution of Networks-From Biological Nets to the Internet and WWW S N Dorogovtsev and J F F Mendes , 2004 .

[20]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[21]  Ericka Stricklin-Parker,et al.  Ann , 2005 .

[22]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[23]  Vittorio Loreto,et al.  Ring structures and mean first passage time in networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Reuven Cohen,et al.  Tomography of scale-free networks and shortest path trees. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Shlomo Havlin,et al.  Origins of fractality in the growth of complex networks , 2005, cond-mat/0507216.

[26]  Reuven Cohen,et al.  Optimal Path and Minimal Spanning Trees in Random Weighted Networks , 2007, Int. J. Bifurc. Chaos.

[27]  J M Buldú,et al.  Synchronization interfaces and overlapping communities in complex networks. , 2008, Physical review letters.

[28]  P A Macri,et al.  Evolution equation for a model of surface relaxation in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  H. Stanley,et al.  Fractal boundaries of complex networks , 2008, 0804.1968.

[30]  James H. Fowler,et al.  Abstract Available online at www.sciencedirect.com Social Networks 30 (2008) 16–30 The authority of Supreme Court precedent , 2022 .

[31]  R. Rosenfeld Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[32]  Shlomo Havlin,et al.  Dynamic opinion model and invasion percolation. , 2009, Physical review letters.