Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks

被引:29
|
作者
Samadi, Negin [1 ]
Bouyer, Asgarali [1 ]
机构
[1] Azarbaijan Shahid Madani Univ, Dept Informat Technol & Commun, Tabriz, Iran
关键词
Complex network; Spreader; Local centrality; Diffusion; SOCIAL NETWORKS; NODES; CENTRALITY; IDENTIFICATION; RANKING;
D O I
10.1007/s00607-018-0659-9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In recent years, notable number of research studies have been conducted on the analysis of diffusion process in complex networks. One fundamental problem in this domain is to find the most influential spreader nodes. For achieving a successful spreading process, nodes having high spreading ability should be selected as spreaders. Many centrality measures have been proposed for determining and ranking the significance of nodes and detecting the best spreaders. The majority of proposed centrality measures require network global information which leads to high time complexity. Moreover, with the advent of large-scale complex networks, there is a critical need for improving accurate measures through using nodes' local information. On the other hand, most of the formerly proposed centrality measures have attempted to select core nodes as spreaders but global bridge nodes have the highest spreading ability since they are located among several giant communities of the network. In this study, a new local and parameter-free centrality measure is proposed which is aimed at finding global bridge nodes in the network. Hence, two new local metrics, namely edge ratio and neighborhood diversity, are firstly defined which are used in the proposed method. Considering edge ratio of neighbors ensures that the selected node be not in the periphery location of the network. Furthermore, a node with high neighborhood diversity is likely a connector between some modules (dense parts) of the network. Therefore, a node with a high edge ratio and more diverse neighborhood has high spreading ability. The major merits of the proposed measure are near-linear time complexity, using local information and being parameter-free. For evaluating the proposed method, we conducted experiments on real-world networks. The results of comparing the proposed centrality measure with other measures in terms of epidemic models (SIR and SI), Kendall's tau correlation coefficient and Rank-Frequency measures indicated that the proposed method outperforms the other compared centrality measures.
引用
收藏
页码:1147 / 1175
页数:29
相关论文
共 50 条
  • [1] Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks
    Negin Samadi
    Asgarali Bouyer
    [J]. Computing, 2019, 101 : 1147 - 1175
  • [2] Identifying and ranking influential spreaders in complex networks by neighborhood coreness
    Bae, Joonhyun
    Kim, Sangwook
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 : 549 - 559
  • [3] Neighborhood coreness algorithm for identifying a set of influential spreaders in complex networks
    Yang, Xiong
    Huang, De-Cai
    Zhang, Zi-Ke
    [J]. KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2017, 11 (06): : 2979 - 2995
  • [4] 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
  • [5] IDENTIFYING AND RANKING INFLUENTIAL SPREADERS IN COMPLEX NETWORKS
    Liang, Zong-Wen
    Li, Jian-Ping
    [J]. 2014 11TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICCWAMTIP), 2014, : 393 - 396
  • [6] Identifying influential spreaders in artificial complex networks
    Pei Wang
    Chengeng Tian
    Jun-an Lu
    [J]. Journal of Systems Science and Complexity, 2014, 27 : 650 - 665
  • [7] Identifying influential spreaders in artificial complex networks
    Wang Pei
    Tian Chengeng
    Lu Jun-an
    [J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2014, 27 (04) : 650 - 665
  • [8] Identifying a set of influential spreaders in complex networks
    Jian-Xiong Zhang
    Duan-Bing Chen
    Qiang Dong
    Zhi-Dan Zhao
    [J]. Scientific Reports, 6
  • [9] Identifying influential spreaders in complex networks based on gravity formula
    Ma, Ling-ling
    Ma, Chuang
    Zhang, Hai-Feng
    Wang, Bing-Hong
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 451 : 205 - 212
  • [10] IDENTIFYING INFLUENTIAL SPREADERS IN ARTIFICIAL COMPLEX NETWORKS
    WANG Pei
    TIAN Chengeng
    LU Jun-an
    [J]. Journal of Systems Science & Complexity, 2014, 27 (04) : 650 - 665