Fast ranking influential nodes in complex networks using a k-shell iteration factor

被引:109
作者
Wang, Zhixiao [1 ,2 ]
Zhao, Ya [1 ]
Xi, Jingke [1 ]
Du, Changjiang [1 ]
机构
[1] China Univ Min & Technol, Sch Comp Sci & Technol, Xuzhou 221116, Jiangsu, Peoples R China
[2] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing 210094, Jiangsu, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Complex network; Influential node ranking; k-shell decomposition; k-shell iteration factor; COMMUNITY STRUCTURE; CENTRALITY; SPREADERS;
D O I
10.1016/j.physa.2016.05.048
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Identifying the influential nodes of complex networks is important for optimizing the network structure or efficiently disseminating information through networks. The k-shell method is a widely used node ranking method that has inherent advantages in performance and efficiency. However, the iteration information produced in k-shell decomposition has been neglected in node ranking. This paper presents a fast ranking method to evaluate the influence capability of nodes using a k-shell iteration factor. The experimental results with respect to monotonicity, correctness and efficiency have demonstrated that the proposed method can yield excellent performance on artificial and real world networks. It discriminates the influence capability of nodes more accurately and provides a more reasonable ranking list than previous methods. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:171 / 181
页数:11
相关论文
共 35 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]  
[Anonymous], THESIS
[3]  
[Anonymous], PSYCHOMETRIKA, DOI DOI 10.1007/BF02289026
[4]   Identifying and ranking influential spreaders in complex networks by neighborhood coreness [J].
Bae, Joonhyun ;
Kim, Sangwook .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 :549-559
[5]   Detecting Influential Spreaders in Complex, Dynamic Networks [J].
Basaras, Pavlos ;
Katsaros, Dimitrios ;
Tassiulas, Leandros .
COMPUTER, 2013, 46 (04) :24-29
[6]   Models of social networks based on social distance attachment -: art. no. 056122 [J].
Boguñá, M ;
Pastor-Satorras, R ;
Díaz-Guilera, A ;
Arenas, A .
PHYSICAL REVIEW E, 2004, 70 (05) :8-1
[7]   Centrality and network flow [J].
Borgatti, SP .
SOCIAL NETWORKS, 2005, 27 (01) :55-71
[8]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[9]   Thresholds for Epidemic Spreading in Networks [J].
Castellano, Claudio ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW LETTERS, 2010, 105 (21)
[10]   Identifying influential nodes in complex networks [J].
Chen, Duanbing ;
Lu, Linyuan ;
Shang, Ming-Sheng ;
Zhang, Yi-Cheng ;
Zhou, Tao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) :1777-1787