An evolving scale-free network with large clustering coefficient

被引:0
作者
Fu, Peihua [1 ,1 ]
Liao, Kun [2 ]
机构
[1] Zhejiang Gongshang Univ, Coll Comp & Informat Engn, Hangzhou 310035, Zhejiang, Peoples R China
[2] Zhejiang Univ, Coll Software, Hangzhou 310027, Peoples R China
来源
2006 9TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION, VOLS 1- 5 | 2006年
关键词
scale-free network; clustering coefficient; model;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Preferential attachment is generally regarded as the best mechanism to form scale-free networks. However, the simulated network has a much smaller clustering coefficient, while many networks in the real world, such as movie actors' collaboration and co-authorship networks, have a high clustering coefficient. So we develop the Relatively Preferential Attachment (RPA) method which considers preferential attachment as well as the probability channel. RPA model can produce networks which not only keep the scale free property but also have high clustering coefficient close to those of real networks.
引用
收藏
页码:1455 / +
页数:2
相关论文
共 8 条
[1]  
Alberich R., CONDMAT0202174
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]   Internet -: Diameter of the World-Wide Web [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 1999, 401 (6749) :130-131
[4]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[5]   Mean-field theory for scale-free random networks [J].
Barabási, AL ;
Albert, R ;
Jeong, H .
PHYSICA A, 1999, 272 (1-2) :173-187
[6]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[7]  
BARAN P, INTRO DISTRIBUTED CO
[8]   Community structure in social and biological networks [J].
Girvan, M ;
Newman, MEJ .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (12) :7821-7826