Universal behavior of load distribution in scale-free networks.

By Kwang-Il Goh, Byungnam Kahng, Dong Chul Kim. Physical Review Letters, 2001

1,136 citations recorded by the source corpus.

We study a problem of data packet transport in scale-free networks whose degree distribution follows a power law with the exponent gamma. 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 delta approximately 2.2(1), insensitive to different values of gamma in the range, 2 < gamma < or = 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.

Subfields: Computer Networks and Communications, Geometry and Topology, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/b19d530b3f3cde199050d9ef16ef553ee25a94c3

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Geometry and Topology

In Statistical and Nonlinear Physics

Citations in the corpus

Layered complex networks. (2005, background): “Indeed, many authors take betweenness as a measure of load either directly [23, 24, 25, 26, 27, 28], or with slight modiﬁca-tions [6, 29, 30] In Fig.”
The Structure and Function of Complex Networks (2003, result): “rous results easier. It is also a logical generalization of the Poisson random graph, in a way that the conﬁguration model is not. Similar approaches have also been taken by a number of other authors [78, 128, 174]. 22 Using arguments similar to those leading to Eq. (31), we can show that the densit”
Analysis of topological characteristics of huge online social networking services (2007, background): “In any fitness-based approach, each node has its own fitness value and they are linked by the function of their fitness values [24, 25, 26].”
Core–Periphery Structure in the Overnight Money Market: Evidence from the e-MID Trading Platform (2015, methodology): “We generate these networks using the approach of Goh et al. (2001).”
Synchronization in complex networks (2008, background): “However, the load of a node in SF networks is closely related to the degree (Barthélemy, 2004; Goh et al., 2001), i.e., nodes with large degrees or links connecting nodes with large degrees have, on average, a large load.”
Cache "less for more" in information-centric networks (extended version) (2012, background): “In [36,37], which investigate load distribution in weighted complex networks, a quantity called load is defined to measure the burden of vertices in the shortest pathbased transport processes.”
Statistical physics of social dynamics (2007, background): “In order to account for degree heterogeneity, other constructions have been proposed for random graphs with arbitrary degree distributions (Aiello and Lu, 2001; Catanzaro et al., 2005; Goh et al., 2001; Molloy and Reed, 1995, 1998).”