Load distribution in weighted complex networks

Kwang-Il Goh, J. D. Noh, B. Kahng, D. Kim

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

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 depends on the cost distribution function pc(c). In the strong disorder limit, where pc(c)∼c-1, the load distribution follows a power law both in the Erdos-Rényi (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.

Original languageEnglish
Article number017102
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume72
Issue number1
DOIs
Publication statusPublished - 2005 Jul 1
Externally publishedYes

Fingerprint

Weighted Networks
Load Distribution
Complex Networks
apexes
Optimal Path
Vertex Degree
Scale-free Networks
Erdös
Disorder
Minimum Spanning Tree
Transport Properties
disorders
costs
Random Graphs
Correlation coefficient
Cost Function
Power Law
Distribution Function
correlation coefficients
transport properties

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Mathematical Physics

Cite this

Load distribution in weighted complex networks. / Goh, Kwang-Il; Noh, J. D.; Kahng, B.; Kim, D.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 72, No. 1, 017102, 01.07.2005.

Research output: Contribution to journalArticle

@article{8bd7e968277b43e087c6699f677df03d,
title = "Load distribution in weighted complex networks",
abstract = "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 depends on the cost distribution function pc(c). In the strong disorder limit, where pc(c)∼c-1, the load distribution follows a power law both in the Erdos-R{\'e}nyi (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.",
author = "Kwang-Il Goh and Noh, {J. D.} and B. Kahng and D. Kim",
year = "2005",
month = "7",
day = "1",
doi = "10.1103/PhysRevE.72.017102",
language = "English",
volume = "72",
journal = "Physical Review E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "1",

}

TY - JOUR

T1 - Load distribution in weighted complex networks

AU - Goh, Kwang-Il

AU - Noh, J. D.

AU - Kahng, B.

AU - Kim, D.

PY - 2005/7/1

Y1 - 2005/7/1

N2 - 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 depends on the cost distribution function pc(c). In the strong disorder limit, where pc(c)∼c-1, the load distribution follows a power law both in the Erdos-Rényi (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.

AB - 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 depends on the cost distribution function pc(c). In the strong disorder limit, where pc(c)∼c-1, the load distribution follows a power law both in the Erdos-Rényi (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.

UR - http://www.scopus.com/inward/record.url?scp=27244447186&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27244447186&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.72.017102

DO - 10.1103/PhysRevE.72.017102

M3 - Article

VL - 72

JO - Physical Review E

JF - Physical Review E

SN - 2470-0045

IS - 1

M1 - 017102

ER -