### Abstract

We study a problem of data packet transport in scale-free networks whose degree distribution follows a power law with the exponent γ. Load, or “betweenness centrality,” of a vertex is the accumulated total number of data packets passing through that vertex when every pair of vertices sends and receives a data packet along the shortest path connecting the pair. It is found that the load distribution follows a power law with the exponent δ≈2.2(1), insensitive to different values of γ in the range, 2 < ≤3, and different mean degrees, which is valid for both undirected and directed cases. Thus, we conjecture that the load exponent is a universal quantity to characterize scale-free networks.

Original language | English |
---|---|

Pages (from-to) | 278701-278701-4 |

Journal | Physical Review Letters |

Volume | 87 |

Issue number | 27 |

DOIs | |

Publication status | Published - 2001 Dec 31 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Physics and Astronomy(all)

### Cite this

*Physical Review Letters*,

*87*(27), 278701-278701-4. https://doi.org/10.1103/PhysRevLett.87.278701

**Universal Behavior of Load Distribution in Scale-Free Networks.** / Goh, Kwang-Il; Kahng, B.; Kim, D.

Research output: Contribution to journal › Article

*Physical Review Letters*, vol. 87, no. 27, pp. 278701-278701-4. https://doi.org/10.1103/PhysRevLett.87.278701

}

TY - JOUR

T1 - Universal Behavior of Load Distribution in Scale-Free Networks

AU - Goh, Kwang-Il

AU - Kahng, B.

AU - Kim, D.

PY - 2001/12/31

Y1 - 2001/12/31

N2 - We study a problem of data packet transport in scale-free networks whose degree distribution follows a power law with the exponent γ. Load, or “betweenness centrality,” of a vertex is the accumulated total number of data packets passing through that vertex when every pair of vertices sends and receives a data packet along the shortest path connecting the pair. It is found that the load distribution follows a power law with the exponent δ≈2.2(1), insensitive to different values of γ in the range, 2 < ≤3, and different mean degrees, which is valid for both undirected and directed cases. Thus, we conjecture that the load exponent is a universal quantity to characterize scale-free networks.

AB - We study a problem of data packet transport in scale-free networks whose degree distribution follows a power law with the exponent γ. Load, or “betweenness centrality,” of a vertex is the accumulated total number of data packets passing through that vertex when every pair of vertices sends and receives a data packet along the shortest path connecting the pair. It is found that the load distribution follows a power law with the exponent δ≈2.2(1), insensitive to different values of γ in the range, 2 < ≤3, and different mean degrees, which is valid for both undirected and directed cases. Thus, we conjecture that the load exponent is a universal quantity to characterize scale-free networks.

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

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

U2 - 10.1103/PhysRevLett.87.278701

DO - 10.1103/PhysRevLett.87.278701

M3 - Article

AN - SCOPUS:84864405239

VL - 87

SP - 278701-278701-4

JO - Physical Review Letters

JF - Physical Review Letters

SN - 0031-9007

IS - 27

ER -