Identifying all-around nodes for spreading dynamics in complex networks

被引:134
作者
Hou, Bonan [1 ]
Yao, Yiping [1 ]
Liao, Dongsheng [2 ]
机构
[1] Natl Univ Def Technol, Sch Comp Sci, Changsha 410073, Hunan, Peoples R China
[2] Natl Univ Def Technol, Sch Humanities & Social Sci, Changsha 410073, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
Influential nodes; Ranking measures; All-around node; Complex networks; CENTRALITY;
D O I
10.1016/j.physa.2012.02.033
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Identifying the most influential nodes in complex networks provides a strong basis for understanding spreading dynamics and ensuring more efficient spread of information. Due to the heterogeneous degree distribution, we observe that current centrality measures are correlated in their results of nodes ranking. This paper introduces the concept of all-around nodes, which act like all-around players with good performance in combined metrics. Then, an all-around distance is presented for quantifying the influence of nodes. The experimental results of susceptible-infectious-recovered (SIR) dynamics suggest that the proposed all-around distance can act as a more accurate, stable indicator of influential nodes. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:4012 / 4017
页数:6
相关论文
共 29 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]  
[Anonymous], PHYS REV E 2
[3]  
[Anonymous], ARXIVCSIR0511016
[4]  
[Anonymous], INTERNET MATH
[5]   A faster algorithm for betweenness centrality [J].
Brandes, U .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177
[6]   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
[7]   A model of Internet topology using k-shell decomposition [J].
Carmi, Shai ;
Havlin, Shlomo ;
Kirkpatrick, Scott ;
Shavitt, Yuval ;
Shir, Eran .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2007, 104 (27) :11150-11154
[8]   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
[9]   Finding scientific gems with Google's PageRank algorithm [J].
Chen, P. ;
Xie, H. ;
Maslov, S. ;
Redner, S. .
JOURNAL OF INFORMETRICS, 2007, 1 (01) :8-15
[10]   Efficient Influence Maximization in Social Networks [J].
Chen, Wei ;
Wang, Yajun ;
Yang, Siyu .
KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, :199-207