A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks

被引:80
|
作者
Berahmand, Kamal [1 ]
Bouyer, Asgarali [1 ]
Samadi, Negin [1 ]
机构
[1] Azarbaijan Shahid Madani Univ, Dept Informat Technol & Commun, Tabriz, Iran
关键词
Complex network; Node spreading; Semi-local centrality; Clustering coefficient; SOCIAL NETWORKS; NODES; IDENTIFICATION; DYNAMICS; RANKING;
D O I
10.1016/j.chaos.2018.03.014
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Identifying the most influential spreaders with the aim of reaching a maximum spreading ability has been a challenging and crucial topic so far. Many centrality measures have been proposed to identify the importance of nodes in spreader detection process. Centrality measures are used to rank the spreading power of nodes. These centralities belong to either local, semi-local, or global category. Local centralities have accuracy problem and global measures need a higher time complexity that are inefficient for large-scale networks. In contrast, semi-local measures are popular methods that have high accuracy and near-linear time complexity. In this paper, we have proposed a new semi-local and free-parameter centrality measure by applying the natural characteristics of complex networks. The proposed centrality can assign higher ranks for structural holes as better spreaders in the network. It uses the positive effects of second-level neighbors' clustering coefficient and negative effects of node's clustering coefficient in defining the importance of nodes. Therefore, the proposed centrality avoids selection of spreaders that are too close to one another. We compare the proposed method with different centrality measures based on Susceptible-Infected- Recovered (SIR) and Susceptible-Infected (SI) models on both artificial and real-world networks. Experiments on both artificial and real networks show that our method has its competitive advantages over the other compared centralities. (c) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:41 / 54
页数:14
相关论文
共 50 条
  • [1] Identifying Influential Spreaders in Complex Multilayer Networks: A Centrality Perspective
    Basaras, Pavlos
    Iosifidis, George
    Katsaros, Dimitrios
    Tassiulas, Leandros
    [J]. IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (01): : 31 - 45
  • [2] Identifying influential spreaders by weight degree centrality in complex networks
    Liu, Yang
    Wei, Bo
    Du, Yuxian
    Xiao, Fuyuan
    Deng, Yong
    [J]. CHAOS SOLITONS & FRACTALS, 2016, 86 : 1 - 7
  • [3] AIGCrank: A new adaptive algorithm for identifying a set of influential spreaders in complex networks based on gravity centrality
    Yang, Ping-Le
    Zhao, Lai-Jun
    Dong, Chen
    Xu, Gui-Qiong
    Zhou, Li-Xin
    [J]. CHINESE PHYSICS B, 2023, 32 (05)
  • [4] AIGCrank: A new adaptive algorithm for identifying a set of influential spreaders in complex networks based on gravity centrality
    杨平乐
    赵来军
    董晨
    徐桂琼
    周立欣
    [J]. Chinese Physics B, 2023, 32 (05) : 827 - 839
  • [5] Identifying influential spreaders in complex networks based on network embedding and node local centrality
    Yang, Xu-Hua
    Xiong, Zhen
    Ma, Fangnan
    Chen, Xiaoze
    Ruan, Zhongyuan
    Jiang, Peng
    Xu, Xinli
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2021, 573
  • [6] Semi-global triangular centrality measure for identifying the influential spreaders from undirected complex networks
    Namtirtha, Amrita
    Dutta, Biswanath
    Dutta, Animesh
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 206
  • [7] Semi-global triangular centrality measure for identifying the influential spreaders from undirected complex networks
    Namtirtha, Amrita
    Dutta, Biswanath
    Dutta, Animesh
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 206
  • [8] A New Method for Identifying Influential Spreaders in Complex Networks
    Qiu, Liqing
    Liu, Yuying
    Zhang, Jianyi
    [J]. COMPUTER JOURNAL, 2024, 67 (01): : 362 - 375
  • [9] A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks
    Wang, Junyi
    Hou, Xiaoni
    Li, Kezan
    Ding, Yong
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 475 : 88 - 105
  • [10] Identifying and Ranking of Best Influential Spreaders With Extended Clustering Coefficient Local Global Centrality Method
    Chiranjeevi, Mondikathi
    Dhuli, V. Sateeshkrishna
    Enduri, Murali Krishna
    Cenkeramaddi, Linga Reddy
    [J]. IEEE ACCESS, 2024, 12 : 52539 - 52554