A voting approach to uncover multiple influential spreaders on weighted networks

被引:34
作者
Sun, Hong-liang [1 ,2 ]
Chen, Duan-bing [3 ]
He, Jia-lin [4 ]
Ch'ng, Eugene [1 ]
机构
[1] Univ Nottingham, Int Doctoral Innovat Ctr, NVIDIA Joint Lab Mixed Real, Ningbo 315100, Zhejiang, Peoples R China
[2] Univ Nottingham, Sch Comp Sci, Ningbo 315100, Zhejiang, Peoples R China
[3] Univ Elect Sci & Technol China, Inst Fundamental & Frontier Sci & Big Data Res Ct, Ctr Digital Culture & Media, Web Sci Ctr, Chengdu 611731, Sichuan, Peoples R China
[4] China West Normal Univ, Sch Comp Sci & Engn, Nanchong 637009, Sichuan, Peoples R China
基金
英国工程与自然科学研究理事会; 中国国家自然科学基金;
关键词
Multiple influential spreaders; Influence maximization; Weighted complex networks; COMPLEX NETWORKS; NODES; IDENTIFICATION; CENTRALITY; INDEX;
D O I
10.1016/j.physa.2018.12.001
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The identification of multiple spreaders on weighted complex networks is a crucial step towards efficient information diffusion, preventing epidemics spreading and etc. In this paper, we propose a novel approach WVoteRank to find multiple spreaders by extending VoteRank. VoteRank has limitations to select multiple spreaders on unweighted networks while various real networks are weighted networks such as trade networks, traffic flow networks and etc. Thus our approach WVoteRank is generalized to deal with both unweighted and weighted networks by considering both degree and weight in voting process. Experimental studies on LFR synthetic networks and real networks show that in the context of Susceptible-Infected-Recovered (SIR) propagation, WVoteRank outperforms existing states of arts methods such as weighted H-index, weighted K-shell, weighted degree centrality and weighted betweeness centrality on final affected scale. It obtains an improvement of final affected scale as much as 8.96%. Linear time complexity enables it to be applied on large networks effectively. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:303 / 312
页数:10
相关论文
共 51 条
[1]  
[Anonymous], 2012, Network Science: An Introduction
[2]   Identification of influential nodes in complex networks: Method from spreading probability viewpoint [J].
Bao, Zhong-Kui ;
Ma, Chuang ;
Xiang, Bing-Bing ;
Zhang, Hai-Feng .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 468 :391-397
[3]   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
[4]   Path diversity improves the identification of influential spreaders [J].
Chen, Duan-Bing ;
Xiao, Rui ;
Zeng, An ;
Zhang, Yi-Cheng .
EPL, 2013, 104 (06)
[5]   Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering [J].
Chen, Duan-Bing ;
Gao, Hui ;
Lu, Linyuan ;
Zhou, Tao .
PLOS ONE, 2013, 8 (10)
[6]   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
[7]   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
[8]   Detecting rich-club ordering in complex networks [J].
Colizza, V ;
Flammini, A ;
Serrano, MA ;
Vespignani, A .
NATURE PHYSICS, 2006, 2 (02) :110-115
[9]   Residual closeness in networks [J].
Dangalchev, Chavdar .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2006, 365 (02) :556-564
[10]   CENTRALITY IN SOCIAL NETWORKS CONCEPTUAL CLARIFICATION [J].
FREEMAN, LC .
SOCIAL NETWORKS, 1979, 1 (03) :215-239