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

Node influence ranking in complex networks: A local structure entropy approach

Author

Listed:
  • Lei, Mingli
  • Cheong, Kang Hao

Abstract

The mining of important nodes in complex networks is a topic of immense interest due to its wide applications across many disciplines. In this paper, a Local Structure Entropy (LSE) approach is proposed based on the Taslli entropy by removing nodes, and by considering the information of the first-order and second-order neighboring nodes, in order to explore the impact of removing nodes on the network structure. With this method, the degree and betweenness of the first-order and second-order adjacent nodes are combined by Taslli entropy, and the influential nodes are measured by the structural characteristics of the network after nodes removal. To verify the effectiveness of LSE, we compare our method with five existing methods and perform experiments on seven real-world networks. The experimental results indicate that the influential nodes identified by LSE are better than the existing methods in terms of the range of information dissemination and robustness. Moreover, it is negatively correlated with closeness centrality and the PageRank algorithm.

Suggested Citation

  • Lei, Mingli & Cheong, Kang Hao, 2022. "Node influence ranking in complex networks: A local structure entropy approach," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    • Handle: RePEc:eee:chsofr:v:160:y:2022:i:c:s0960077922003460
    DOI: 10.1016/j.chaos.2022.112136
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077922003460
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2022.112136?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. Yang, Meng & Chen, Guanrong & Fu, Xinchu, 2011. "A modified SIS model with an infective medium on complex networks and its global stability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(12), pages 2408-2413.
    2. Pablo M. Gleiser & Leon Danon, 2003. "Community Structure In Jazz," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 6(04), pages 565-573.
    3. Huang, Chuangxia & Wen, Shigang & Li, Mengge & Wen, Fenghua & Yang, Xin, 2021. "An empirical evaluation of the influential nodes for stock market network: Chinese A-shares case," Finance Research Letters, Elsevier, vol. 38(C).
    4. Ramirez-Arellano, Aldo & Hernández-Simón, Luis Manuel & Bory-Reyes, Juan, 2021. "Two-parameter fractional Tsallis information dimensions of complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 150(C).
    5. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
    6. Yuanzhi Yang & Lei Yu & Xing Wang & Siyi Chen & You Chen & Yipeng Zhou, 2020. "A novel method to identify influential nodes in complex networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 31(02), pages 1-14, February.
    7. Kumar, Sanjay & Panda, B.S., 2020. "Identifying influential nodes in Social Networks: Neighborhood Coreness based voting approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    8. Pu, Jia & Jia, Tao & Li, Ya, 2019. "Effects of time cost on the evolution of cooperation in snowdrift game," Chaos, Solitons & Fractals, Elsevier, vol. 125(C), pages 146-151.
    9. Wen, Tao & Jiang, Wen, 2019. "Identifying influential nodes based on fuzzy local dimension in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 119(C), pages 332-342.
    10. Ye, Ye & Hang, Xiao Rong & Koh, Jin Ming & Miszczak, Jarosław Adam & Cheong, Kang Hao & Xie, Neng-gang, 2020. "Passive network evolution promotes group welfare in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 130(C).
    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. Yang, Pingle & Meng, Fanyuan & Zhao, Laijun & Zhou, Lixin, 2023. "AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(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. 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).
    2. Liu, Panfeng & Li, Longjie & Fang, Shiyu & Yao, Yukai, 2021. "Identifying influential nodes in social networks: A voting approach," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    3. Wang, Yan & Li, Haozhan & Zhang, Ling & Zhao, Linlin & Li, Wanlan, 2022. "Identifying influential nodes in social networks: Centripetal centrality and seed exclusion approach," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    4. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    5. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
    6. Xu, Guiqiong & Meng, Lei, 2023. "A novel algorithm for identifying influential nodes in complex networks based on local propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    7. Fei, Liguo & Zhang, Qi & Deng, Yong, 2018. "Identifying influential nodes in complex networks based on the inverse-square law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1044-1059.
    8. Hajarathaiah, Koduru & Enduri, Murali Krishna & Anamalamudi, Satish, 2022. "Efficient algorithm for finding the influential nodes using local relative change of average shortest path," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    9. Du, Yuxian & Lin, Xi & Pan, Ye & Chen, Zhaoxin & Xia, Huan & Luo, Qian, 2023. "Identifying influential airports in airline network based on failure risk factors with TOPSIS," Chaos, Solitons & Fractals, Elsevier, vol. 169(C).
    10. Xiao, Feng & Li, Jin & Wei, Bo, 2022. "Cascading failure analysis and critical node identification in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 596(C).
    11. Lei, Mingli, 2022. "Information dimension based on Deng entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    12. Yang, Pingle & Meng, Fanyuan & Zhao, Laijun & Zhou, Lixin, 2023. "AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
    13. Zhang, Wen-Yao & Wei, Zong-Wen & Wang, Bing-Hong & Han, Xiao-Pu, 2016. "Measuring mixing patterns in complex networks by Spearman rank correlation coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 440-450.
    14. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    15. Rezvanian, Alireza & Meybodi, Mohammad Reza, 2015. "Sampling social networks using shortest paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 254-268.
    16. Kong, Hanzhang & Kang, Qinma & Li, Wenquan & Liu, Chao & Kang, Yunfan & He, Hong, 2019. "A hybrid iterated carousel greedy algorithm for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    17. Yuan, Quan & Liu, Binghui, 2021. "Community detection via an efficient nonconvex optimization approach based on modularity," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    18. Jia, Shuyi & Lai, Joel Weijia & Koh, Jin Ming & Xie, Neng Gang & Cheong, Kang Hao, 2020. "Parrondo effect: Exploring the nature-inspired framework on periodic functions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 556(C).
    19. Wei, Xiaodan & Zhao, Xu & Zhou, Wenshu, 2022. "Global stability of a network-based SIS epidemic model with a saturated treatment function," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 597(C).
    20. 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.

    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:160:y:2022:i:c:s0960077922003460. 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.