Load distribution in weighted complex networks

Details Load distribution in weighted complex networks Load distribution in weighted complex networks

2004-10-13

arxiv.org/abs/cond-mat/0410317v2

Phys. Rev. E 72, 017102 (2005)

Physics

Condensed Matter

Statistical Mechanics

4 pages, 4 figures, final version published in PRE

Scientific paper

10.1103/PhysRevE.72.017102

We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution function $p_c(c)$. In the strong disorder limit, where $p_c(c)\sim c^{-1}$, the load distribution follows a power law both in the Erd\H{o}s-R\'enyi (ER) random graphs and in the scale-free (SF) networks, and its characteristics are determined by the structure of the minimum spanning tree. The distribution of loads at vertices with a given vertex degree also follows the SF nature similar to the whole load distribution, implying that the global transport property is not correlated to the local structural information. Finally, we measure the effect of disorder by the correlation coefficient between vertex degree and load, finding that it is larger for ER networks than for SF networks.

Affiliated with

Also associated with

No associations

Rating

Load distribution in weighted complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Load distribution in weighted complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Load distribution in weighted complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-135977