首页 | 本学科首页   官方微博 | 高级检索  
     检索      

论无标度网的增长和择优
引用本文:赵永毅,史定华.论无标度网的增长和择优[J].上海大学学报(自然科学版),2007,13(3):288-293.
作者姓名:赵永毅  史定华
作者单位:上海大学 理学院,上海 200444
摘    要:增长和择优机制是无标度网络中两种重要的演化机制,已发现比较重要的择优机制有度择优和秩次择优,比较重要的增长方式有星形图增长和完全图增长.该文首先分析了秩次择优机制对网络度指数的影响,指出可以利用秩次择优来构造度指数在较大范围内变化的模型. 接下来分析了星形图增长和完全图增长的优缺点,并提出了更符合实际情况的模体增长方式,然后结合秩次择优机制和模体增长方式提出了一个新模型——模体增长秩次择优模型,该模型除了具有较宽的度指数范围外,还在度指数大于2.5时具有独立于网络规模的群集系数.

关 键 词:度择优  模体增长  完全图增长  无标度网络  星形图增长  秩次择优  
文章编号:1007-2861(2007)03-0288-06
收稿时间:2006-07-19
修稿时间:2006年7月19日

Growth and Preferential Attachment in Scale-Free Networks
ZHAO Yong-yi,SHI Ding-hua.Growth and Preferential Attachment in Scale-Free Networks[J].Journal of Shanghai University(Natural Science),2007,13(3):288-293.
Authors:ZHAO Yong-yi  SHI Ding-hua
Institution:School of Sciences, Shanghai University, Shanghai 200444, China
Abstract:Growth and preferential attachment are important mechanisms in forming scale-free networks.There are two methods of important preferential attachment: degree preferential attachment and ranking preferential attachment,and two methods of important growing: star-like graph growth and complete graph growth.In this paper,ranking preferential attachment is analyzed to show that it can be used to construct model that have wide range of degree exponent.A new model with motif growth and ranking preferential attachment is then constructed.The model has a wide range of degree exponent,and its clustering coefficient is independent of the network size when the degree exponent is larger than 2.5.
Keywords:scale-free networks  star-like graph growth  complete graph growth  degree  preferential attachment  ranking preferential attachment  motif growth
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《上海大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《上海大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号