SpreadRank: A Novel Approach for Identifying Influential Spreaders in Complex Networks

被引:7
|
作者
Zhu, Xuejin [1 ]
Huang, Jie [1 ,2 ]
机构
[1] Southeast Univ, Sch Cyber Sci & Engn, Nanjing 211189, Peoples R China
[2] Purple Mt Labs, Nanjing 211111, Peoples R China
关键词
information diffusion; node centrality; influential spreaders; complex networks; SIR model; RUMOR PROPAGATION; IDENTIFICATION; CENTRALITY; MODEL; NODE; SET;
D O I
10.3390/e25040637
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Identifying influential spreaders in complex networks is critical for information spread and malware diffusion suppression. In this paper, we propose a novel influential spreader identification method, called SpreadRank, which considers the path reachability in information spreading and uses its quantitative index as a measure of node spread centrality to obtain the spread influence of a single node. To avoid the overlapping of the influence range of the node spread, this method establishes a dynamic influential node set selection mechanism based on the spread centrality value and the principle of minimizing the maximum connected branch after network segmentation, and it selects a group of nodes with the greatest overall spread influence. Experiments based on the SIR model demonstrate that, compared to other existing methods, the selected influential spreaders of SpreadRank can quickly diffuse or suppress information more effectively.
引用
收藏
页数:13
相关论文
共 50 条
  • [31] Identification of influential spreaders in complex networks
    Kitsak, Maksim
    Gallos, Lazaros K.
    Havlin, Shlomo
    Liljeros, Fredrik
    Muchnik, Lev
    Stanley, H. Eugene
    Makse, Hernan A.
    NATURE PHYSICS, 2010, 6 (11) : 888 - 893
  • [32] Identification of influential spreaders in complex networks
    Maksim Kitsak
    Lazaros K. Gallos
    Shlomo Havlin
    Fredrik Liljeros
    Lev Muchnik
    H. Eugene Stanley
    Hernán A. Makse
    Nature Physics, 2010, 6 : 888 - 893
  • [33] Identifying Influential Spreaders in Complex Networks by Considering the Impact of the Number of Shortest Paths
    LUAN Yangyang
    BAO Zhongkui
    ZHANG Haifeng
    Journal of Systems Science & Complexity, 2021, 34 (06) : 2168 - 2181
  • [34] Identifying a set of influential spreaders in complex networks (vol 6, 27823, 2016)
    Zhang, Jian-Xiong
    Chen, Duan-Bing
    Dong, Qiang
    Zhao, Zhi-Dan
    SCIENTIFIC REPORTS, 2016, 6
  • [35] 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
  • [36] Identifying multiple influential spreaders in complex networks based on spectral graph theory
    崔东旭
    何嘉林
    肖子飞
    任卫平
    Chinese Physics B, 2023, 32 (09) : 696 - 703
  • [37] Identifying multiple influential spreaders with local relative weakening effect in complex networks
    Zhang, Yaming
    Su, Yanyuan
    Li Weigang
    Koura, Yaya H.
    EPL, 2018, 124 (02)
  • [38] Identifying influential spreaders in complex networks based on density entropy and community structure
    苏湛
    陈磊
    艾均
    郑雨语
    别娜
    Chinese Physics B, 2024, 33 (05) : 779 - 788
  • [39] Identifying influential spreaders in complex networks using neighbourhood coreness and path diversity
    Yang, Xiong
    Xie, Guangqian
    Li, Xiaofang
    International Journal of Security and Networks, 2021, 16 (03) : 174 - 182
  • [40] Identifying Influential Spreaders in Complex Networks by Considering the Impact of the Number of Shortest Paths
    Luan, Yangyang
    Bao, Zhongkui
    Zhang, Haifeng
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2021, 34 (06) : 2168 - 2181