DocumentCode
2320113
Title
An Evolving Scale-free Network with Large Clustering Coefficient
Author
Fu, Peihua ; Liao, Kun
Author_Institution
Coll. of Electr. Eng., Zhejiang Univ., Hangzhou
fYear
2006
fDate
5-8 Dec. 2006
Firstpage
1
Lastpage
4
Abstract
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
Keywords
computer networks; probability; clustering coefficient; evolving scale-free network; probability channel; relatively preferential attachment; Collaboration; Complex networks; Computational modeling; Educational institutions; Motion pictures; Nearest neighbor searches; Neural networks; Power grids; World Wide Web; Clustering coefficient; Model; Scale-free network;
fLanguage
English
Publisher
ieee
Conference_Titel
Control, Automation, Robotics and Vision, 2006. ICARCV '06. 9th International Conference on
Conference_Location
Singapore
Print_ISBN
1-4244-0341-3
Electronic_ISBN
1-4214-042-1
Type
conf
DOI
10.1109/ICARCV.2006.345053
Filename
4150252
Link To Document