Identifying influential spreaders in artificial complex networks

被引:24
作者
Wang Pei [1 ]
Tian Chengeng [2 ]
Lu Jun-an [2 ]
机构
[1] Henan Univ, Sch Math & Informat Sci, Kaifeng 475004, Peoples R China
[2] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
Complex network; influential spreader; k-shell; scale free; small world; SOCIAL NETWORKS; MODEL;
D O I
10.1007/s11424-014-2236-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A long-term common belief in complex networks is that, the most connected nodes are the most efficient spreaders. However, recent investigations on real-world complex networks show that the most influential spreaders are those with the highest k-shell values. It is well-known that, many real-world complex networks have scale free (SF), small world (SW) properties, therefore, identification of influential spreaders in general artificial SF, SW as well as random networks will be more appealing. This research finds that, for artificial ER and SW networks, degree is more reliable than k-shell in predicting the outcome of spreading. However, for artificial SF networks, k-shell is remarkably reliable than degree and betweeness, which indicate that the four recently investigated real-world networks [Kitsak M, Gallos L K, Havlin S, Liljeros F, Muchnik L, Stanley H E, Makse H A, Identification of influential spreaders in complex networks, Nat. Phys., 2010, 6: 888-893.] are more similar to scale free ones. Moreover, the investigations also indicate us an optimal dissemination strategy in networks with scale free property. That is, starting from moderate-degree-nodes will be ok and even more economical, since one can derive roughly similar outcome with starting from hubs.
引用
收藏
页码:650 / 665
页数:16
相关论文
共 50 条
[31]   Evaluating influential spreaders in complex networks by extension of degree [J].
Min Lei ;
Liu Zhi ;
Tang Xiang-Yang ;
Chen Mao ;
Liu San-Ya .
ACTA PHYSICA SINICA, 2015, 64 (08)
[32]   Identify influential spreaders in complex networks, the role of neighborhood [J].
Liu, Ying ;
Tang, Ming ;
Zhou, Tao ;
Do, Younghae .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 452 :289-298
[33]   Identifying influential spreaders using multi-objective artificial bee colony optimization [J].
Sheikhahmadi, Amir ;
Zareie, Ahmad .
APPLIED SOFT COMPUTING, 2020, 94
[34]   Role of centrality for the identification of influential spreaders in complex networks [J].
de Arruda, Guilherme Ferraz ;
Barbieri, Andre Luiz ;
Rodriguez, Pablo Martin ;
Rodrigues, Francisco A. ;
Moreno, Yamir ;
Costa, Luciano da Fontoura .
PHYSICAL REVIEW E, 2014, 90 (03)
[35]   Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient [J].
Li, Mengtian ;
Zhang, Ruisheng ;
Hu, Rongjing ;
Yang, Fan ;
Yao, Yabing ;
Yuan, Yongna .
INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2018, 32 (06)
[36]   Semi-global triangular centrality measure for identifying the influential spreaders from undirected complex networks [J].
Namtirtha, Amrita ;
Dutta, Biswanath ;
Dutta, Animesh .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 206
[37]   Identifying the Top-k Influential Spreaders in Social Networks: a Survey and Experimental Evaluation [J].
Taha, Kamal .
IEEE ACCESS, 2022, 10 :107809-107845
[38]   AIGCrank: A new adaptive algorithm for identifying a set of influential spreaders in complex networks based on gravity centrality [J].
Yang, Ping-Le ;
Zhao, Lai-Jun ;
Dong, Chen ;
Xu, Gui-Qiong ;
Zhou, Li-Xin .
CHINESE PHYSICS B, 2023, 32 (05)
[39]   Semi-global triangular centrality measure for identifying the influential spreaders from undirected complex networks [J].
Namtirtha, Amrita ;
Dutta, Biswanath ;
Dutta, Animesh .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 206
[40]   Identifying influential spreaders based on indirect spreading in neighborhood [J].
Yu, Senbin ;
Gao, Liang ;
Xu, Lida ;
Gao, Zi-You .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 523 :418-425