2007
DOI: 10.1103/physreve.75.021102
|View full text |Cite
|
Sign up to set email alerts
|

Power-law strength-degree correlation from resource-allocation dynamics on weighted networks

Abstract: Many weighted scale-free networks are known to have a power-law correlation between strength and degree of nodes, which, however, has not been well explained. We investigate the dynamic behavior of resource-traffic flow on scale-free networks. The dynamical system will evolve into a kinetic equilibrium state, where the strength, defined by the amount of resource or traffic load, is correlated with the degree in a power-law form with tunable exponent. The analytical results agree well with simulations.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
94
0
1

Year Published

2009
2009
2023
2023

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 185 publications
(95 citation statements)
references
References 29 publications
0
94
0
1
Order By: Relevance
“…A measure that takes into account the structural connectivity of a node by the number of edges incident to that node as well as the weights of those edges representing their functional role is the strength. A node's strength, s i , is the sum of the weights of edges incident to node i [10]. Node strength strongly correlates with energy dissipation and captures the strain localisation, as shown in Figure 1(right).…”
Section: Dem Datamentioning
confidence: 99%
“…A measure that takes into account the structural connectivity of a node by the number of edges incident to that node as well as the weights of those edges representing their functional role is the strength. A node's strength, s i , is the sum of the weights of edges incident to node i [10]. Node strength strongly correlates with energy dissipation and captures the strain localisation, as shown in Figure 1(right).…”
Section: Dem Datamentioning
confidence: 99%
“…This index is motivated by the resource allocation dynamics on complex networks [48]. Consider a pair of nodes, x and y, which are not directly connected.…”
Section: Local Similarity Indicesmentioning
confidence: 99%
“…We use a diffusion process to obtain similarities between users [20,21]. The basic idea is shown in Fig.…”
Section: Diffusion-based Similaritymentioning
confidence: 99%