Anomalous transport in scale-free networks.

To study transport properties of scale-free and Erdos-Rényi networks, we analyze the conductance G between two arbitrarily chosen nodes of random scale-free networks with degree distribution P(k)-k(-lambda) in which all links have unit resistance. We predict a broad range of values of G, with a power-law tail distribution phi(SF)(G)-G(-g(G)), where g(G)=2lambda-1, and confirm our predictions by simulations. The power-law tail in phi(SF)(G) leads to large values of G, signaling better transport in scale-free networks compared to Erdos-Rényi networks where the tail of the conductivity distribution decays exponentially. Based on a simple physical "transport backbone" picture we show that the conductances of scale-free and Erdos-Rényi networks are well approximated by ck(A)k(B)/(k(A)+k(B)) for any pair of nodes A and B with degrees k(A) and k(B), where c emerges as the main parameter characterizing network transport.

[1]  G. Grimmett,et al.  RANDOM ELECTRICAL NETWORKS ON COMPLETE GRAPHS , 1984 .

[2]  Kevin E. Bassler,et al.  Network dynamics: Jamming is limited in scale-free systems , 2004, Nature.

[3]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  B. M. Fulk.  MATH , 1992 .

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

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

[7]  L. Gallos.  Random walk and trapping processes on scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[9]  S Redner,et al.  Statistics of weighted treelike networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[11]  H. Simon,et al.  ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS , 1955 .

[12]  S. Redner,et al.  First-passage properties of the Erdos Renyi random graph , 2004, cond-mat/0410309.

[13]  宁北芳,et al.  疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A , 2005 .

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

[15]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[16]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

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

[18]  P. Gács,et al.  Algorithms , 1992 .

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