论无标度网的增长和择优

上海大学学报(自然科学版)

论无标度网的增长和择优

赵永毅，史定华

上海大学理学院，上海 200444

收稿日期:2006-07-19 修回日期:1900-01-01 出版日期:2007-06-30 发布日期:2007-06-30
通讯作者: 史定华

Growth and Preferential Attachment in Scale-Free Networks

ZHAO Yong-yi, SHI Ding-hua

School of Sciences, Shanghai University, Shanghai 200444, China

Received:2006-07-19 Revised:1900-01-01 Online:2007-06-30 Published:2007-06-30
Contact: SHI Ding-hua

摘要/Abstract

摘要： 增长和择优机制是无标度网络中两种重要的演化机制，已发现比较重要的择优机制有度择优和秩次择优，比较重要的增长方式有星形图增长和完全图增长.该文首先分析了秩次择优机制对网络度指数的影响，指出可以利用秩次择优来构造度指数在较大范围内变化的模型. 接下来分析了星形图增长和完全图增长的优缺点，并提出了更符合实际情况的模体增长方式，然后结合秩次择优机制和模体增长方式提出了一个新模型——模体增长秩次择优模型，该模型除了具有较宽的度指数范围外，还在度指数大于2.5时具有独立于网络规模的群集系数.

关键词: 度择优, 模体增长, 完全图增长, 无标度网络, 星形图增长, 秩次择优

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.

Key words: complete graph growth, degree preferential attachment, motif growth
, ranking preferential attachment, star-like graph growth, scale-free networks

中图分类号:

N94
TP39

赵永毅;史定华. 论无标度网的增长和择优[J]. 上海大学学报(自然科学版).

ZHAO Yong-yi;SHI Ding-hua. Growth and Preferential Attachment in Scale-Free Networks[J]. Journal of Shanghai University（Natural Science Edition）.

[1]	李婧, 于丽英. 基于直觉模糊集的模糊C均值聚类改进算法[J]. 上海大学学报(自然科学版), 2018, 24(4): 634-641.
[2]	石秀伦,张维琛,蒋妙法,唐伯良. 彩电副载波恢复电路的研究与调试[J]. 上海大学学报(自然科学版), 1995, 1(3): 338-346.
[3]	胡南钟. 人眼动态视觉特性分析[J]. 上海大学学报(自然科学版), 1995, 1(2): 212-217.