A new method to identify influential nodes based on relative entropy

被引:54
作者
Fei, Liguo [1 ]
Deng, Yong [1 ,2 ,3 ]
机构
[1] Southwest Univ, Sch Comp & Informat Sci, Chongqing 400715, Peoples R China
[2] Xi An Jiao Tong Univ, Inst Integrated Automat, Sch Elect & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[3] Vanderbilt Univ, Sch Engn, 221 Kirkland Hall, Nashville, TN 37235 USA
基金
中国国家自然科学基金;
关键词
Complex networks; Influential nodes; Centrality measure; Relative entropy; TOPSIS; COMPLEX NETWORKS; WEIGHTED NETWORKS; BELIEF STRUCTURES; FAILURE MODE; D NUMBERS; CENTRALITY; MATRIX; FLOW; IDENTIFICATION; PAYOFFS;
D O I
10.1016/j.chaos.2017.08.010
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
How to identify influential nodes is still an open and vital issue in complex networks. To address this problem, a lot of centrality measures have been developed, however, only single measure is focused on by the existing studies, which has its own shortcomings. In this paper, a novel method is proposed to identify influential nodes using relative entropy and TOPSIS method, which combines the advantages of existing centrality measures. Because information flow spreads in different ways in different networks. In the specific network, the appropriate centrality measures should be considered to sort the nodes. In addition, the remoteness between the alternative and the positive/negetive ideal solution is redefined based on relative entropy, which is proven to be more effective in TOPSIS method. To demonstrate the effectiveness of the proposed method, four real networks are selected to conduct several experiments for identifying influential nodes, and the advantages of the method can be illustrated based on the experimental results. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:257 / 267
页数:11
相关论文
共 50 条
  • [31] Identifying influential nodes in complex networks based on the inverse-square law
    Fei, Liguo
    Zhang, Qi
    Deng, Yong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 512 : 1044 - 1059
  • [32] Measure the structure similarity of nodes in complex networks based on relative entropy
    Zhang, Qi
    Li, Meizhu
    Deng, Yong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 491 : 749 - 763
  • [33] Multi-factor information matrix: A directed weighted method to identify influential nodes in social networks
    Wang, Yan
    Zhang, Ling
    Yang, Junwen
    Yan, Ming
    Li, Haozhan
    CHAOS SOLITONS & FRACTALS, 2024, 180
  • [34] A hybrid influence method based on information entropy to identify the key nodes
    Zhong, Linfeng
    Gao, Xiangying
    Zhao, Liang
    Zhang, Lei
    Chen, Pengfei
    Yang, Hao
    Huang, Jin
    Pan, Weijun
    FRONTIERS IN PHYSICS, 2023, 11
  • [35] A new evidential methodology of identifying influential nodes in complex networks
    Bian, Tian
    Deng, Yong
    CHAOS SOLITONS & FRACTALS, 2017, 103 : 101 - 110
  • [36] Ranking Influential Nodes in Complex Networks with Information Entropy Method
    Zhao, Nan
    Bao, Jingjing
    Chen, Nan
    COMPLEXITY, 2020, 2020
  • [37] Identifying influential nodes: A new method based on network efficiency of edge weight updating
    Shang, Qiuyan
    Zhang, Bolong
    Li, Hanwen
    Deng, Yong
    CHAOS, 2021, 31 (03)
  • [38] A new method for identifying influential nodes based on D-S evidence theory
    Cai, Die
    Wang, Zhixuan
    Wang, Ningkui
    Wei, Daijun
    2017 29TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2017, : 4603 - 4609
  • [39] A dynamic weighted TOPSIS method for identifying influential nodes in complex networks
    Yang, Pingle
    Liu, Xin
    Xu, Guiqiong
    MODERN PHYSICS LETTERS B, 2018, 32 (19):
  • [40] A novel potential edge weight method for identifying influential nodes in complex networks based on neighborhood and position
    Meng, Lei
    Xu, Guiqiong
    Yang, Pingle
    Tu, Dengqin
    JOURNAL OF COMPUTATIONAL SCIENCE, 2022, 60