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 条
  • [1] IDENTIFYING INFLUENTIAL SPREADERS IN ARTIFICIAL COMPLEX NETWORKS
    WANG Pei
    TIAN Chengeng
    LU Jun-an
    Journal of Systems Science & Complexity, 2014, 27 (04) : 650 - 665
  • [2] Identifying influential spreaders in artificial complex networks
    Pei Wang
    Chengeng Tian
    Jun-an Lu
    Journal of Systems Science and Complexity, 2014, 27 : 650 - 665
  • [3] IDENTIFYING AND RANKING INFLUENTIAL SPREADERS IN COMPLEX NETWORKS
    Liang, Zong-Wen
    Li, Jian-Ping
    2014 11TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICCWAMTIP), 2014, : 393 - 396
  • [4] An improved voterank algorithm to identifying a set of influential spreaders in complex networks
    Li, Yaxiong
    Yang, Xinzhi
    Zhang, Xinwei
    Xi, Mingyuan
    Lai, Xiaochang
    FRONTIERS IN PHYSICS, 2022, 10
  • [5] Identifying Influential Spreaders in Complex Networks by an Improved Spectralrank Algorithm
    Liu, Chunfang
    Wang, Pei
    Chen, Aimin
    2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 736 - 741
  • [6] Identifying influential spreaders in complex networks based on gravity formula
    Ma, Ling-ling
    Ma, Chuang
    Zhang, Hai-Feng
    Wang, Bing-Hong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 451 : 205 - 212
  • [7] Identifying and ranking influential spreaders in complex networks by neighborhood coreness
    Bae, Joonhyun
    Kim, Sangwook
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 : 549 - 559
  • [8] Identifying and Ranking Influential Spreaders in Complex Networks by Localized Decreasing Gravity Model
    Xiang, Nan
    Tang, Xiao
    Liu, Huiling
    Ma, Xiaoxia
    COMPUTER JOURNAL, 2023, 67 (05) : 1727 - 1746
  • [9] A New Method for Identifying Influential Spreaders in Complex Networks
    Qiu, Liqing
    Liu, Yuying
    Zhang, Jianyi
    COMPUTER JOURNAL, 2024, 67 (01) : 362 - 375
  • [10] SpreadRank: A Novel Approach for Identifying Influential Spreaders in Complex Networks
    Zhu, Xuejin
    Huang, Jie
    ENTROPY, 2023, 25 (04)