Transport and percolation theory in weighted networks.

We study the distribution P(sigma) of the equivalent conductance sigma for Erdös-Rényi (ER) and scale-free (SF) weighted resistor networks with N nodes. Each link has conductance g triple bond e-ax, where x is a random number taken from a uniform distribution between 0 and 1 and the parameter a represents the strength of the disorder. We provide an iterative fast algorithm to obtain P(sigma) and compare it with the traditional algorithm of solving Kirchhoff equations. We find, both analytically and numerically, that P(sigma) for ER networks exhibits two regimes: (i) A low conductance regime for sigma<e-apc, where pc=1/(k) is the critical percolation threshold of the network and k is the average degree of the network. In this regime P(sigma) is independent of N and follows the power law P(sigma) approximately sigma-alpha, where alpha=1-(ka)/a. (ii) A high conductance regime for sigma>e-apc in which we find that P(sigma) has strong N dependence and scales as P(sigma) approximately f(sigma,apc/N1/3) . For SF networks with degree distribution P(k) approximately k-lambda, kmin<or=k<or=kmax, we find numerically also two regimes, similar to those found for ER networks.

[1]  Sameet Sreenivasan,et al.  Effect of disorder strength on optimal paths in complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  K. N. Dollman,et al.  - 1 , 1743 .

[3]  Shlomo Havlin,et al.  Scaling of optimal-path-lengths distribution in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Shlomo Havlin,et al.  Percolation transition in a two-dimensional system of Ni granular ferromagnets. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  A Bunde,et al.  Optimal paths in disordered media: scaling of the crossover from self-similar to self-affine behavior. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[6]  Random Electrical Networks on Complete Graphs II: Proofs , 2001, math/0107068.

[7]  S. Havlin,et al.  Fractals and Disordered Systems , 1991 .

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

[9]  Shlomo Havlin,et al.  Universal behavior of optimal paths in weighted networks with general disorder. , 2006, Physical review letters.

[10]  Maritan,et al.  Optimal paths and domain walls in the strong disorder limit. , 1994, Physical review letters.

[11]  Maritan,et al.  Invasion percolation and Eden growth: Geometry and universality. , 1996, Physical review letters.

[12]  Shlomo Havlin,et al.  Anomalous transport in scale-free networks. , 2005, Physical review letters.

[13]  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.

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

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

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

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

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

[19]  Shlomo Havlin,et al.  Current flow in random resistor networks: the role of percolation in weak and strong disorder. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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