Universal Behavior of Load Distribution in Scale-free Networks
Abstract
We study a problem of data packet transport in scale-free networks whose degree distribution follows a power-law with the exponent γ. We define load at each vertex as the accumulated total number of data packets passing through that vertex when every pair of vertices send and receive 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.