检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:WU XiaoHuan ZHU JinFu WU WeiWei GE Wei
机构地区:[1]College of Civil Aviation,Nanjing University of Aeronautics and Astronautics [2]Guangxi Airport Group
出 处:《Science China(Physics,Mechanics & Astronomy)》2013年第9期1619-1626,共8页中国科学:物理学、力学、天文学(英文版)
基 金:supported by the National Natural Science Foundation of China (Grant Nos.71171111,70771046 and 71201081);the Colleges Graduate Research and Innovation Program of Jiangsu Province (Grant Nos.CXZZ11-0220 and CX10B-102Z)
摘 要: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.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.
关 键 词:complex network EVOLVING weighted network capacity constraints SIMULATION
分 类 号:N941.4[自然科学总论—系统科学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117