IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v104y2017icp257-267.html
   My bibliography  Save this article

A new method to identify influential nodes based on relative entropy

Author

Listed:
  • Fei, Liguo
  • Deng, Yong

Abstract

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.

Suggested Citation

  • Fei, Liguo & Deng, Yong, 2017. "A new method to identify influential nodes based on relative entropy," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 257-267.
    • Handle: RePEc:eee:chsofr:v:104:y:2017:i:c:p:257-267
    DOI: 10.1016/j.chaos.2017.08.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077917303296
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2017.08.010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Deng, Xinyang & Liu, Qi & Deng, Yong, 2016. "Matrix games with payoffs of belief structures," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 868-879.
    2. Stefania Vitali & James B Glattfelder & Stefano Battiston, 2011. "The Network of Global Corporate Control," PLOS ONE, Public Library of Science, vol. 6(10), pages 1-6, October.
    3. Du, Yuxian & Gao, Cai & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "A new method of identifying influential nodes in complex networks based on TOPSIS," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 399(C), pages 57-69.
    4. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    5. Cai Gao & Xin Lan & Xiaoge Zhang & Yong Deng, 2013. "A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-11, June.
    6. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    7. Wei, Daijun & Deng, Xinyang & Zhang, Xiaoge & Deng, Yong & Mahadevan, Sankaran, 2013. "Identifying influential nodes in weighted networks based on evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2564-2575.
    8. Bai, Wen-Jie & Zhou, Tao & Wang, Bing-Hong, 2007. "Immunization of susceptible–infected model on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 384(2), pages 656-662.
    9. Linyuan Lü & Yi-Cheng Zhang & Chi Ho Yeung & Tao Zhou, 2011. "Leaders in Social Networks, the Delicious Case," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-9, June.
    10. Lee, Yan-Li & Zhou, Tao, 2017. "Fast asynchronous updating algorithms for k-shell indices," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 482(C), pages 524-531.
    11. Li, Chenzhao & Mahadevan, Sankaran, 2016. "Role of calibration, validation, and relevance in multi-level uncertainty integration," Reliability Engineering and System Safety, Elsevier, vol. 148(C), pages 32-43.
    12. Gómez, Daniel & Figueira, José Rui & Eusébio, Augusto, 2013. "Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems," European Journal of Operational Research, Elsevier, vol. 226(2), pages 354-365.
    13. Hui-Jia Li & Huiying Li & Chuanliang Jia, 2015. "A novel dynamics combination model reveals the hidden information of community structure," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 26(04), pages 1-13.
    14. Xiaoge Zhang & Felix T.S. Chan & Andrew Adamatzky & Sankaran Mahadevan & Hai Yang & Zili Zhang & Yong Deng, 2017. "An intelligent physarum solver for supply chain network design under profit maximization and oligopolistic competition," International Journal of Production Research, Taylor & Francis Journals, vol. 55(1), pages 244-263, January.
    15. Shen, Chen & Lu, Jun & Shi, Lei, 2016. "Does coevolution setup promote cooperation in spatial prisoner's dilemma game?," Applied Mathematics and Computation, Elsevier, vol. 290(C), pages 201-207.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tornyeviadzi, Hoese Michel & Owusu-Ansah, Emmanuel & Mohammed, Hadi & Seidu, Razak, 2022. "A systematic framework for dynamic nodal vulnerability assessment of water distribution networks based on multilayer networks," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    2. Tang, Jinjun & Li, Zhitao & Gao, Fan & Zong, Fang, 2021. "Identifying critical metro stations in multiplex network based on D–S evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    3. Ni, Chengzhang & Yang, Jun & Kong, Demei, 2020. "Sequential seeding strategy for social influence diffusion with improved entropy-based centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    4. Cai, Wenxue & Liang, Fenfen & Wan, Yanchun & Zhong, Huiling & Gu, Yimiao, 2021. "An innovative approach for constructing a shipping index based on dynamic weighted complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    5. Jia, Jianlin & Chen, Yanyan & Wang, Yang & Li, Tongfei & Li, Yongxing, 2021. "A new global method for identifying urban rail transit key station during COVID-19: A case study of Beijing, China," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    6. Ting Chen & Jianxiao Ma & Zhenjun Zhu & Xiucheng Guo, 2023. "Evaluation Method for Node Importance of Urban Rail Network Considering Traffic Characteristics," Sustainability, MDPI, vol. 15(4), pages 1-20, February.
    7. Tuğal, İhsan & Karcı, Ali, 2019. "Comparisons of Karcı and Shannon entropies and their effects on centrality of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 352-363.
    8. Meng, Yangyang & Tian, Xiangliang & Li, Zhongwen & Zhou, Wei & Zhou, Zhijie & Zhong, Maohua, 2020. "Exploring node importance evolution of weighted complex networks in urban rail transit," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 558(C).
    9. Wang, Longjian & Zheng, Shaoya & Wang, Yonggang & Wang, Longfei, 2021. "Identification of critical nodes in multimodal transportation network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 580(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wei, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    2. Du, Yuxian & Gao, Cai & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "A new method of identifying influential nodes in complex networks based on TOPSIS," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 399(C), pages 57-69.
    3. Bian, Tian & Hu, Jiantao & Deng, Yong, 2017. "Identifying influential nodes in complex networks based on AHP," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 422-436.
    4. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    5. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    6. Zhai, Li & Yan, Xiangbin & Zhang, Guojing, 2018. "Bi-directional h-index: A new measure of node centrality in weighted and directed networks," Journal of Informetrics, Elsevier, vol. 12(1), pages 299-314.
    7. Zhang, Xiaohong & Li, Zhiying & Qian, Kai & Ren, Jianji & Luo, Junwei, 2020. "Influential node identification in a constrained greedy way," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    8. Liu, Jie & Li, Yunpeng & Ruan, Zichan & Fu, Guangyuan & Chen, Xiaowu & Sadiq, Rehan & Deng, Yong, 2015. "A new method to construct co-author networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 29-39.
    9. Ahmad, Amreen & Ahmad, Tanvir & Bhatt, Abhishek, 2020. "HWSMCB: A community-based hybrid approach for identifying influential nodes in the social network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    10. Duan-Bing Chen & Hui Gao & Linyuan Lü & Tao Zhou, 2013. "Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering," PLOS ONE, Public Library of Science, vol. 8(10), pages 1-10, October.
    11. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Shokrollahi, Arman, 2015. "Improving detection of influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 833-845.
    12. Chaharborj, Sarkhosh Seddighi & Nabi, Khondoker Nazmoon & Feng, Koo Lee & Chaharborj, Shahriar Seddighi & Phang, Pei See, 2022. "Controlling COVID-19 transmission with isolation of influential nodes," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    13. Gao, Cai & Yan, Chao & Zhang, Zili & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "An amoeboid algorithm for solving linear transportation problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 398(C), pages 179-186.
    14. Chen, Yahong & Li, Jinlin & Huang, He & Ran, Lun & Hu, Yusheng, 2017. "Encouraging information sharing to boost the name-your-own-price auction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 108-117.
    15. Zhou, Ming-Yang & Xiong, Wen-Man & Wu, Xiang-Yang & Zhang, Yu-Xia & Liao, Hao, 2018. "Overlapping influence inspires the selection of multiple spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 76-83.
    16. Wang, Yanhui & Bi, Lifeng & Lin, Shuai & Li, Man & Shi, Hao, 2017. "A complex network-based importance measure for mechatronics systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 180-198.
    17. Seema Rani & Monica Mehrotra, 2019. "Community Detection in Social Networks: Literature Review," Journal of Information & Knowledge Management (JIKM), World Scientific Publishing Co. Pte. Ltd., vol. 18(02), pages 1-28, June.
    18. Deng, Xinyang & Deng, Yong, 2014. "On the axiomatic requirement of range to measure uncertainty," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 406(C), pages 163-168.
    19. Curado, Manuel & Rodriguez, Rocio & Tortosa, Leandro & Vicent, Jose F., 2022. "Anew centrality measure in dense networks based on two-way random walk betweenness," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    20. Xu, Shuqi & Mariani, Manuel Sebastian & Lü, Linyuan & Medo, Matúš, 2020. "Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data," Journal of Informetrics, Elsevier, vol. 14(1).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:104:y:2017:i:c:p:257-267. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.