检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算物理》2013年第2期309-316,共8页Chinese Journal of Computational Physics
基 金:教育部人文与社会科学研究基金项目(09YJAZH072);西北工业大学研究生创业种子基金(GCKY4002;Z2013170)项目资助
摘 要:分析两类无标度网络的形成原因,提出一个无标度网络演化模型并进行一系列数值实验.基于分析和实验得到推论:只要保持足够低的网络密度,通过基于度的偏好连接就可形成长期稳定的无标度网络.规模增长和点边增删既是客观存在,又起到了控制网络密度的作用,足够低的网络密度和基于度的偏好连接是所有无标度网络共同的必要条件.推论可同时解释增长和非增长无标度网络的形成原因.研究结果有助于理解各种真实无标度网络和建立相应的模型.Causes of two classes of scale-free networks are analyzed. A scale-free network evolution model is proposed and a series of numerical experiments are carried out. Theoretical analysis and numerical experiments show that if network density is sparse and stable enough, a persistently stable scale-free network can be produced by degree-based preferential attachment. Growth of network size as well as addition and deletion of vertices and edges are objective realities. They have the function of controlling network density as well. A sufficiently sparse density and degree-based preferential attachment are common necessities of scale-free networks. This deduction can be used to explain reasonably the cause of growing and non-growing scale-free networks. The results are helpful in understanding diversified real scale-free networks and design of corresponding models.
关 键 词:增长网络 非增长网络 无标度网络 偏好连接 网络密度
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.195