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 , insensitive to different values of in the range, , 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.
- Received 26 June 2001
DOI:https://doi.org/10.1103/PhysRevLett.87.278701
©2001 American Physical Society