Fast influencers in complex networks

被引:40
作者
Zhou, Fang [1 ]
Lu, Linyuan [1 ,2 ]
Mariani, Manuel Sebastian [1 ,3 ]
机构
[1] Univ Elect Sci & Technol China, Inst Fundamental & Frontier Sci, Chengdu 610054, Sichuan, Peoples R China
[2] Hangzhou Normal Univ, Alibaba Res Ctr Complex Sci, Hangzhou 311121, Zhejiang, Peoples R China
[3] Univ Zurich, URPP Social Networks, Zurich, Switzerland
来源
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION | 2019年 / 74卷
基金
中国国家自然科学基金;
关键词
Complex Networks; Diffusion Phenomena; Influential spreaders; Network Centrality; IDENTIFICATION; NODES; INFLUENTIALS; SPREADERS; DIFFUSION;
D O I
10.1016/j.cnsns.2019.01.032
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Influential nodes in complex networks are typically defined as those nodes that maximize the asymptotic reach of a spreading process of interest. However, for practical applications such as viral marketing and online information spreading, one is often interested in maximizing the reach of the process in a short amount of time. The traditional definition of influencers in network-related studies from diverse research fields narrows down the focus to the late-time state of the spreading processes, leaving the following question unsolved: which nodes are able to initiate large-scale spreading processes, in a limited amount of time? Here, we find that there is a fundamental difference between the nodes - which we call "fast influencers" - that initiate the largest-reach processes in a short amount of time, and the traditional, "late-time" influencers. Stimulated by this observation, we provide an extensive benchmarking of centrality metrics with respect to their ability to identify both the fast and late-time influencers. We find that local network properties can be used to uncover the fast influencers. In particular, a parsimonious, local centrality metric (which we call social capital) achieves optimal or nearly-optimal performance in the fast influencer identification for all the analyzed empirical networks. Local metrics tend to be also competitive in the traditional, late-time influencer identification task. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:69 / 83
页数:15
相关论文
共 48 条
[1]  
[Anonymous], KOBLENZ NETWORK COLL
[2]   The Social Climbing Game [J].
Bardoscia, Marco ;
De Luca, Giancarlo ;
Livan, Giacomo ;
Marsili, Matteo ;
Tessone, Claudio J. .
JOURNAL OF STATISTICAL PHYSICS, 2013, 151 (3-4) :440-457
[3]   Eigenvector-like measures of centrality for asymmetric relations [J].
Bonacich, P ;
Lloyd, P .
SOCIAL NETWORKS, 2001, 23 (03) :191-201
[4]   Emergence of Influential Spreaders in Modified Rumor Models [J].
Borge-Holthoefer, Javier ;
Meloni, Sandro ;
Goncalves, Bruno ;
Moreno, Yamir .
JOURNAL OF STATISTICAL PHYSICS, 2013, 151 (1-2) :383-393
[5]   Absence of influential spreaders in rumor dynamics [J].
Borge-Holthoefer, Javier ;
Moreno, Yamir .
PHYSICAL REVIEW E, 2012, 85 (02)
[6]   A faster algorithm for betweenness centrality [J].
Brandes, U .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177
[7]   The Spread of Behavior in an Online Social Network Experiment [J].
Centola, Damon .
SCIENCE, 2010, 329 (5996) :1194-1197
[8]   Path diversity improves the identification of influential spreaders [J].
Chen, Duan-Bing ;
Xiao, Rui ;
Zeng, An ;
Zhang, Yi-Cheng .
EPL, 2013, 104 (06)
[9]   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)
[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