IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v198y2025ics0960077925005867.html

Identifying critical nodes in complex networks via a Multi-Scale Influence Spread method

Author

Listed:
  • Ma, Jinlong
  • Hu, Jiahao

Abstract

Evaluating the propagation influence of nodes is crucial for understanding the survival and robustness of networks. In recent years, numerous methods have been widely applied to identify high-influence nodes, such as degree centrality and K-shell decomposition, which are based on single network features. However, these methods often fail to fully capture the propagation potential of nodes. To improve upon existing methods, we propose a novel heuristic method based on the Multi-Scale Influence Spread (MSIS). MSIS integrates various network characteristics, including node degree, clustering coefficient, and the influence and propagation distance of neighboring nodes, providing a more comprehensive evaluation of node influence. The main advantage of MSIS is its multi-scale method, which integrates both local and global network features to more effectively assess node propagation influence. Furthermore, MSIS eliminates the need for parameter tuning, enhancing its robustness and applicability across different network scenarios. Experiments conducted on eight real-world networks indicate that MSIS surpasses seven other methods in terms of node ranking performance, identifying influential nodes, and maintaining ranking monotonicity. MSIS also exhibits strong robustness and adaptability across diverse network topologies, effectively identifying critical nodes and assessing influence propagation. We offers a novel approach for identifying critical nodes in complex networks. Future research could focus on reducing computational complexity, enhancing adaptability to complex topologies, and deriving more universal global metrics from local features to optimize performance.

Suggested Citation

  • Ma, Jinlong & Hu, Jiahao, 2025. "Identifying critical nodes in complex networks via a Multi-Scale Influence Spread method," Chaos, Solitons & Fractals, Elsevier, vol. 198(C).
  • Handle: RePEc:eee:chsofr:v:198:y:2025:i:c:s0960077925005867
    DOI: 10.1016/j.chaos.2025.116573
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077925005867
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2025.116573?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Wang, Shuliang & Lv, Wenzhuo & Zhang, Jianhua & Luan, Shengyang & Chen, Chen & Gu, Xifeng, 2021. "Method of power network critical nodes identification and robustness enhancement based on a cooperative framework," Reliability Engineering and System Safety, Elsevier, vol. 207(C).
    2. Zhu, Xiaoyu & Hao, Rongxia, 2024. "Identifying influential nodes in social networks via improved Laplacian centrality," Chaos, Solitons & Fractals, Elsevier, vol. 189(P1).
    3. Hosni, Adil Imad Eddine & Li, Kan & Ahmad, Sadique, 2020. "Analysis of the impact of online social networks addiction on the propagation of rumors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 542(C).
    4. Wang, Junyi & Hou, Xiaoni & Li, Kezan & Ding, Yong, 2017. "A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 88-105.
    5. Zareie, Ahmad & Sheikhahmadi, Amir & Fatemi, Adel, 2017. "Influential nodes ranking in complex networks: An entropy-based approach," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 485-494.
    6. 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.
    7. 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).
    8. 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).
    9. Bae, Joonhyun & Kim, Sangwook, 2014. "Identifying and ranking influential spreaders in complex networks by neighborhood coreness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 549-559.
    10. Douglas Guilbeault & Damon Centola, 2021. "Topological measures for identifying and predicting the spread of complex contagions," Nature Communications, Nature, vol. 12(1), pages 1-9, December.
    11. Huang, Wencheng & Li, Haoran & Yin, Yanhui & Zhang, Zhi & Xie, Anhao & Zhang, Yin & Cheng, Guo, 2024. "Node importance identification of unweighted urban rail transit network: An Adjacency Information Entropy based approach," Reliability Engineering and System Safety, Elsevier, vol. 242(C).
    12. 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).
    13. Zhu, Xiaoyu & Hao, Rongxia, 2025. "Finding influential nodes in complex networks by integrating nodal intrinsic and extrinsic centrality," Chaos, Solitons & Fractals, Elsevier, vol. 194(C).
    14. Wang, Min & Li, Wanchun & Guo, Yuning & Peng, Xiaoyan & Li, Yingxiang, 2020. "Identifying influential spreaders in complex networks based on improved k-shell method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
    Full references (including those not matched with items on IDEAS)

    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. Zhu, Xiaoyu & Hao, Rongxia, 2025. "Finding influential nodes in complex networks by integrating nodal intrinsic and extrinsic centrality," Chaos, Solitons & Fractals, Elsevier, vol. 194(C).
    2. Zhu, Xiaoyu & Hao, Rongxia, 2024. "Identifying influential nodes in social networks via improved Laplacian centrality," Chaos, Solitons & Fractals, Elsevier, vol. 189(P1).
    3. Wu, Jian & Qiu, Tian & Chen, Guang, 2024. "A general deep-learning approach to node importance identification," Chaos, Solitons & Fractals, Elsevier, vol. 188(C).
    4. Ma, Jinlong & Hu, Jiahao, 2025. "A novel algorithm for identifying key propagation nodes in complex networks based on Neighborhood Gravitational Structural Centrality," Chaos, Solitons & Fractals, Elsevier, vol. 200(P3).
    5. 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).
    6. Huang, Xu-Dong & Zhang, Xian-Jie & Zhang, Hai-Feng, 2025. "A contrastive learning framework of graph reconstruction and hypergraph learning for key node identification," Chaos, Solitons & Fractals, Elsevier, vol. 197(C).
    7. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
    8. Zareie, Ahmad & Sheikhahmadi, Amir, 2019. "EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 141-155.
    9. Yin, Rongrong & Li, Linhui & Wang, Yumeng & Lang, Chun & Hao, Zhenyang & Zhang, Le, 2024. "Identifying critical nodes in complex networks based on distance Laplacian energy," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    10. 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).
    11. 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).
    12. Wang, Jinping & Sun, Shaowei, 2024. "Identifying influential nodes: A new method based on dynamic propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 185(C).
    13. Guo, Haoming & Wang, Shuangling & Yan, Xuefeng & Zhang, Kecheng, 2024. "Node importance evaluation method of complex network based on the fusion gravity model," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
    14. Liu, Yan & Wang, Bin & Zhang, Simeng & Tian, Pengxu & Zhang, Hexin & Liu, Chenlu & Jiang, Xinyan, 2025. "Influential nodes identification based on Quasi-Laplacian Gravity Model," Chaos, Solitons & Fractals, Elsevier, vol. 200(P3).
    15. Li, Shaobao & Quan, Yiran & Luo, Xiaoyuan & Wang, Juan & Tian, Changyong & Guan, Xinping, 2025. "Identifying influential nodes in complex networks via weighted k-shell entropy-based approach," Chaos, Solitons & Fractals, Elsevier, vol. 199(P3).
    16. Huang, Yuxin & Li, Chunping & Xiang, Yan & Xian, Yantuan & Li, Pu & Yu, Zhengtao, 2025. "Effective and efficient identifying influential nodes in large scale networks by structural entropy," Chaos, Solitons & Fractals, Elsevier, vol. 196(C).
    17. Wang, Min & Li, Wanchun & Guo, Yuning & Peng, Xiaoyan & Li, Yingxiang, 2020. "Identifying influential spreaders in complex networks based on improved k-shell method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
    18. Wang, Xiaojie & Slamu, Wushour & Guo, Wenqiang & Wang, Sixiu & Ren, Yan, 2022. "A novel semi local measure of identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    19. Zhao, Zhili & Liu, Xupeng & Sun, Yue & Zhang, Nana & Hu, Ahui & Wang, Shiling & Tu, Yingyuan, 2025. "Influence maximization based on bottom-up community merging," Chaos, Solitons & Fractals, Elsevier, vol. 193(C).
    20. Jin, Ziyang & Wang, Yifan & Meng, Xueyu & Duan, Dongli & Wang, Ning, 2025. "Identifying critical roads in urban road networks considering congestion propagation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 675(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:198:y:2025:i:c:s0960077925005867. 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.