.png){kind=icon}
.png){kind=icon}
Return
A weighted network evolving model with capacity constraints
.png){kind=icon}
PRE
AI
DOI：10.1007/s11433-013-5131-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most of existing works on complex network assumed that the nodes and edges were uncapacitated during the evolving process, and displayed rich club phenomenon. Here we will show that the rich club could be changed to common rich if we consider the node capacity. In this paper, we define the node and edge attractive index with node capacity, and propose a new evolving model on the base of BBV model, with evolving simulations of the networks. In the new model, an entering node is linked with an existing node according to the preferential attachment mechanism defined with the attractive index of the existing node. We give the theoretical approximation and simulation solutions. If node capacity is finite, the rich node may not be richer further when the node strength approaches or gets to the node capacity. This is confirmed by analyzing the passenger traffic and routes of Chinese main airports. Due to node strength being function of time t, we can use the theoretical approximation solution to forecast how node strength changes and the time when node strength reaches its maximum value.
Keywords:
complex network
evolving
weighted network
capacity constraints
simulation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
7.5
Papers:
3.9K
Citations:
7.4K
Organization
No organization information available