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 条
  • [1] 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
  • [2] 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
  • [3] Identifying and ranking influential spreaders in complex networks with consideration of spreading probability
    Ma, Qian
    Ma, Jun
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 465 : 312 - 330
  • [4] Ranking spreaders by decomposing complex networks
    Zeng, An
    Zhang, Cheng-Jun
    PHYSICS LETTERS A, 2013, 377 (14) : 1031 - 1035
  • [5] 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
  • [6] Identify influential spreaders in complex real-world networks
    Liu, Ying
    Tang, Ming
    Yue, Jing
    Gong, Jie
    IEEE 12TH INT CONF UBIQUITOUS INTELLIGENCE & COMP/IEEE 12TH INT CONF ADV & TRUSTED COMP/IEEE 15TH INT CONF SCALABLE COMP & COMMUN/IEEE INT CONF CLOUD & BIG DATA COMP/IEEE INT CONF INTERNET PEOPLE AND ASSOCIATED SYMPOSIA/WORKSHOPS, 2015, : 1144 - 1148
  • [7] A novel ranking approach for identifying crucial spreaders in complex networks based on Tanimoto Correlation
    Tong, Tianchi
    Yuan, Wenying
    Jalili, Mahdi
    Dong, Qian
    Sun, Jinsheng
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 255
  • [8] A method based on link prediction for identifying set of super-spreaders in complex networks
    Hosseini, Bayan
    Veisi, Farshid
    Sheikhahmdi, Amir
    JOURNAL OF COMPLEX NETWORKS, 2023, 11 (02)
  • [9] Iterative resource allocation for ranking spreaders in complex networks
    Ren, Zhuo-Ming
    Zeng, An
    Chen, Duan-Bing
    Liao, Hao
    Liu, Jian-Guo
    EPL, 2014, 106 (04)
  • [10] Identifying influential spreaders in artificial complex networks
    Pei Wang
    Chengeng Tian
    Jun-an Lu
    Journal of Systems Science and Complexity, 2014, 27 : 650 - 665