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 条
[21]   Identifying influential spreaders by weighted LeaderRank [J].
Li, Qian ;
Zhou, Tao ;
Lu, Linyuan ;
Chen, Duanbing .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 404 :47-55
[22]   Identifying Influential Spreaders in Complex Networks Based on Weighted Mixed Degree Decomposition Method [J].
S. Raamakirtinan ;
L. M. Jenila Livingston .
Wireless Personal Communications, 2022, 127 (3) :2103-2119
[23]   Identifying Influential Spreaders in Complex Networks Based on Weighted Mixed Degree Decomposition Method [J].
Raamakirtinan, S. ;
Livingston, L. M. Jenila .
WIRELESS PERSONAL COMMUNICATIONS, 2022, 127 (03) :2103-2119
[24]   An efficient algorithm for mining a set of influential spreaders in complex networks [J].
Jiang, Lincheng ;
Zhao, Xiang ;
Ge, Bin ;
Xiao, Weidong ;
Ruan, Yirun .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 516 (58-65) :58-65
[25]   Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks [J].
Negin Samadi ;
Asgarali Bouyer .
Computing, 2019, 101 :1147-1175
[26]   Influential Spreaders Identification in Complex Networks With TOPSIS and K-Shell Decomposition [J].
Liu, Xiaoyang ;
Ye, Shu ;
Fiumara, Giacomo ;
De Meo, Pasquale .
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2023, 10 (01) :347-361
[27]   A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks [J].
Berahmand, Kamal ;
Bouyer, Asgarali ;
Samadi, Negin .
CHAOS SOLITONS & FRACTALS, 2018, 110 :41-54
[28]   Identifying the influential spreaders in multilayer interactions of online social networks [J].
Al-Garadi, Mohammed Ali ;
Varathan, Kasturi Dewi ;
Ravana, Sri Devi ;
Ahmed, Ejaz ;
Chang, Victor .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2016, 31 (05) :2721-2735
[29]   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)
[30]   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