Identifying and ranking super spreaders in real world complex networks without influence overlap

被引:34
|
作者
Maji, Giridhar [1 ]
Dutta, Animesh [2 ]
Malta, Mariana Curado [3 ,4 ]
Sen, Soumya [5 ]
机构
[1] Asansol Polytech, Dept Elect Engn, Asansol, W Bengal, India
[2] Natl Inst Technol, Dept Comp Sci & Engn, Durgapur, WB, India
[3] CEOS PP Polytech Porto, Porto, Portugal
[4] Univ Minho, Algoritmi Ctr, Braga, Portugal
[5] Univ Calcutta, AK Choudhury Sch Informat Technol, Kolkata, India
关键词
Influential spreader identification; Spreading overlap; Seed selection with minimum geodesic; SIR simulation; Monotonicity; Kendall's rank correlation; COMMUNITY STRUCTURE; SOCIAL NETWORKS; NODES; IDENTIFICATION; INFORMATION; ALGORITHM;
D O I
10.1016/j.eswa.2021.115061
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the present-days complex networks modeled on real-world data contain millions of nodes and billions of links. Identifying super spreaders in such an extensive network is a challenging task. Super spreaders are the most important or influential nodes in the network that play the central role during an infection spreading or information diffusion process. Depending on the application, either the most influential node needs to be identified, or a set of initial seed nodes are identified that can maximize the collective influence or the total spread in the network. Many centrality measures have been proposed to rank nodes in a complex network such as 'degree', 'closeness', 'betweenness', 'coreness' or 'k-shell' centrality, among others. All have some kind of inherent limitations. Mixed degree decomposition or m-shell is an improvement over k-shell that yields better ranking. Many researchers have employed single node identification heuristics to select multiple seed nodes by considering top-k nodes from the ranked list. This approach does not results in the optimal seed nodeset due to the considerable overlap in total spreading influence. Influence overlap occurs when multiple nodes from the seed nodeset influence a specific node, and it is counted multiple times during total collective influence computation. In this paper, we exploit the 'node degree', 'closeness' and 'coreness' among the nodes and propose novel heuristic template to rank the super spreaders in a network. We employ k-shell and m-shell as a coreness measure in two variants for a comparative evaluation. We use a geodesic-based constraint (enforcing a minimum distance between seed nodes) to select an initial seed nodeset from that ranked nodes for influence maximization instead of selecting the top-k nodes naively. All models and metrics are updated to avoid overlapping influence during total spread computation. Experimental simulation with the SIR (Susceptible-Infectious-Recovered) spreading model and an evaluation with performance metrics like spreadability, monotonicity of ranking, Kendall's rank correlation on some benchmark real-world networks establish the superiority of the proposed methods and the improved seed node selection technique.
引用
收藏
页数:22
相关论文
共 50 条
  • [21] Identification of influential spreaders based on classified neighbors in real-world complex networks
    Li, Chao
    Wang, Li
    Sun, Shiwen
    Xia, Chengyi
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 320 : 512 - 523
  • [22] Identifying influential spreaders in complex networks by an improved gravity model
    Li, Zhe
    Huang, Xinyu
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [23] Correction: Corrigendum: Identifying a set of influential spreaders in complex networks
    Jian-Xiong Zhang
    Duan-Bing Chen
    Qiang Dong
    Zhi-Dan Zhao
    Scientific Reports, 6
  • [24] Identifying Influential Spreaders in Complex Multilayer Networks: A Centrality Perspective
    Basaras, Pavlos
    Iosifidis, George
    Katsaros, Dimitrios
    Tassiulas, Leandros
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (01): : 31 - 45
  • [25] 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
  • [26] 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
  • [27] Identifying influential spreaders in complex networks by propagation probability dynamics
    Chen, Duan-Bing
    Sun, Hong-Liang
    Tang, Qing
    Tian, Sheng-Zhao
    Xie, Mei
    CHAOS, 2019, 29 (03)
  • [28] SpreadRank: A Novel Approach for Identifying Influential Spreaders in Complex Networks
    Zhu, Xuejin
    Huang, Jie
    ENTROPY, 2023, 25 (04)
  • [29] Identifying influential spreaders in complex networks for disease spread and control
    Wei, Xiang
    Zhao, Junchan
    Liu, Shuai
    Wang, Yisi
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [30] Identifying influential spreaders in complex networks for disease spread and control
    Xiang Wei
    Junchan Zhao
    Shuai Liu
    Yisi Wang
    Scientific Reports, 12