The Structure and Dynamics of Networks 2011
DOI: 10.1515/9781400841356.368
|View full text |Cite
|
Sign up to set email alerts
|

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 γ. Load, or betweenness centrality of a vertex is 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 di… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Load centrality (Figure 3D') was measured via the load_centrality() function in NetworkX, which is based on (Goh et al, 2011) . Load centrality of a node is the fraction of all shortest paths between each pair of nodes in the network that passes through that node.…”
Section: Measures Of Centralitymentioning
confidence: 99%
“…Load centrality (Figure 3D') was measured via the load_centrality() function in NetworkX, which is based on (Goh et al, 2011) . Load centrality of a node is the fraction of all shortest paths between each pair of nodes in the network that passes through that node.…”
Section: Measures Of Centralitymentioning
confidence: 99%
“…1a for undirected Erdös-Rényi random graph [50] and Fig. 1b for scale-free networks [51]). Yet, the critical point q c of energy difference between canonical and conformity systems do depend on the average degree.…”
Section: Resultsmentioning
confidence: 99%