TY - JOUR
T1 - Modeling the coevolution of topology and traffic on weighted technological networks
AU - Xie, Yan Bo
AU - Wang, Wen Xu
AU - Wang, Bing Hong
PY - 2007/2/28
Y1 - 2007/2/28
N2 - For many technological networks, the network structures and the traffic taking place on them mutually interact. The demands of traffic increment spur the evolution and growth of the networks to maintain their normal and efficient functioning. In parallel, a change of the network structure leads to redistribution of the traffic. In this paper, we perform an extensive numerical and analytical study, extending results of Wang [Phys. Rev. Lett. 94, 188702 (2005)]. By introducing a general strength-coupling interaction driven by the traffic increment between any pair of vertices, our model generates networks of scale-free distributions of strength, weight, and degree. In particular, the obtained nonlinear correlation between vertex strength and degree, and the disassortative property demonstrate that the model is capable of characterizing weighted technological networks. Moreover, the generated graphs possess both dense clustering structures and an anticorrelation between vertex clustering and degree, which are widely observed in real-world networks. The corresponding theoretical predictions are well consistent with simulation results.
AB - For many technological networks, the network structures and the traffic taking place on them mutually interact. The demands of traffic increment spur the evolution and growth of the networks to maintain their normal and efficient functioning. In parallel, a change of the network structure leads to redistribution of the traffic. In this paper, we perform an extensive numerical and analytical study, extending results of Wang [Phys. Rev. Lett. 94, 188702 (2005)]. By introducing a general strength-coupling interaction driven by the traffic increment between any pair of vertices, our model generates networks of scale-free distributions of strength, weight, and degree. In particular, the obtained nonlinear correlation between vertex strength and degree, and the disassortative property demonstrate that the model is capable of characterizing weighted technological networks. Moreover, the generated graphs possess both dense clustering structures and an anticorrelation between vertex clustering and degree, which are widely observed in real-world networks. The corresponding theoretical predictions are well consistent with simulation results.
UR - http://www.scopus.com/inward/record.url?scp=33847617106&partnerID=8YFLogxK
U2 - 10.1103/PhysRevE.75.026111
DO - 10.1103/PhysRevE.75.026111
M3 - 文章
AN - SCOPUS:33847617106
SN - 1539-3755
VL - 75
JO - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
JF - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
IS - 2
M1 - 026111
ER -