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

A novel algorithm for identifying key propagation nodes in complex networks based on Neighborhood Gravitational Structural Centrality

Author

Listed:
  • Ma, Jinlong
  • Hu, Jiahao

Abstract

To comprehend the structure and operation of complex networks, it is essential to quantitatively evaluate the influence of nodes. In order to increase the precision of identifying important nodes in networks, we propose a unique influence identification algorithm called Neighborhood Gravitational Structural Centrality (NHGS). The algorithm measures the coupling of propagation between a node and its neighbors through Local Gravitational Strength (LGS), reflects the node’s global topological position using Structural Hybrid Score (SHS), and evaluates the node’s actual propagation range by introducing the Neighbor Influence Index (NII), which incorporates propagation overlap among higher-order neighbors. Finally, by integrating local connectivity, global structural position, and propagation overlap across adjacent layers, the algorithm provides a comprehensive evaluation of a node’s influence potential. Extensive experiments were carried out on eight real-world networks in order to verify the algorithm’s efficacy. Using Kendall’s tau, Jaccard similarity, and monotonicity metrics, comparisons were made with seven representative algorithms. The results of the experiment demonstrate that the proposed algorithm outperforms other algorithms in terms of differentiating ability and ranking accuracy, providing a quick and accurate way to assess node effect.

Suggested Citation

  • 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).
  • Handle: RePEc:eee:chsofr:v:200:y:2025:i:p3:s0960077925010720
    DOI: 10.1016/j.chaos.2025.117059
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.chaos.2025.117059?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. Ai, Jun & He, Tao & Su, Zhan & Shang, Lihui, 2022. "Identifying influential nodes in complex networks based on spreading probability," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    2. Liu, Qiang & Zhu, Yu-Xiao & Jia, Yan & Deng, Lu & Zhou, Bin & Zhu, Jun-Xing & Zou, Peng, 2018. "Leveraging local h-index to identify and rank influential spreaders in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 379-391.
    3. Qu, Junyi & Tang, Ming & Liu, Ying & Guan, Shuguang, 2020. "Identifying influential spreaders in reversible process," Chaos, Solitons & Fractals, Elsevier, vol. 140(C).
    4. 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.
    5. 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.
    6. Linyuan Lü & Tao Zhou & Qian-Ming Zhang & H. Eugene Stanley, 2016. "The H-index of a network node and its relation to degree and coreness," Nature Communications, Nature, vol. 7(1), pages 1-7, April.
    7. 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).
    8. 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.
    9. Wang, Jinping & Sun, Shaowei, 2024. "Identifying influential nodes: A new method based on dynamic propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 185(C).
    10. 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).
    11. Hadia Ahmed & T. C. Howton & Yali Sun & Natascha Weinberger & Youssef Belkhadir & M. Shahid Mukhtar, 2018. "Network biology discovers pathogen contact points in host protein-protein interactomes," Nature Communications, Nature, vol. 9(1), pages 1-13, December.
    12. Hong, Li & Xu, Mengqiao & Liu, Yu & Zhang, Xuemei & Fan, Changjun, 2025. "A deep learning dismantling approach for understanding the structural vulnerability of complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 194(C).
    13. Niklas Boers & Bedartha Goswami & Aljoscha Rheinwalt & Bodo Bookhagen & Brian Hoskins & Jürgen Kurths, 2019. "Complex networks reveal global pattern of extreme-rainfall teleconnections," Nature, Nature, vol. 566(7744), pages 373-377, February.
    14. 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).
    15. Yang, Hanchao & liu, Yujia & Wan, Qian & Deng, Yong, 2019. "A bio-inspired optimal network division method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 527(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. 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).
    2. 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).
    3. Wang, Longyun & Mou, Jianhong & Dai, Bitao & Tan, Suoyi & Cai, Mengsi & Chen, Huan & Jin, Zhen & Sun, Guiquan & Lu, Xin, 2024. "Influential nodes identification based on hierarchical structure," Chaos, Solitons & Fractals, Elsevier, vol. 186(C).
    4. 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).
    5. 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.
    6. Zhu, Xiaoyu & Hao, Rongxia, 2024. "Identifying influential nodes in social networks via improved Laplacian centrality," Chaos, Solitons & Fractals, Elsevier, vol. 189(P1).
    7. 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).
    8. 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).
    9. Wu, Jian & Qiu, Tian & Chen, Guang, 2024. "A general deep-learning approach to node importance identification," Chaos, Solitons & Fractals, Elsevier, vol. 188(C).
    10. Meng, Lei & Xu, Guiqiong & Dong, Chen, 2025. "An improved gravity model for identifying influential nodes in complex networks considering asymmetric attraction effect," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 657(C).
    11. 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).
    12. 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).
    13. Wu, Yali & Dong, Ang & Ren, Yuanguang & Jiang, Qiaoyong, 2023. "Identify influential nodes in complex networks: A k-orders entropy-based method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P1).
    14. Xu, Shuang & Wang, Pei, 2017. "Identifying important nodes by adaptive LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 654-664.
    15. 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).
    16. 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.
    17. Wang, Jinping & Sun, Shaowei, 2024. "Identifying influential nodes: A new method based on dynamic propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 185(C).
    18. Wang, Yan & Zhang, Ling & Yang, Junwen & Yan, Ming & Li, Haozhan, 2024. "Multi-factor information matrix: A directed weighted method to identify influential nodes in social networks," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    19. 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).
    20. Ullah, Aman & Meng, Yahui, 2025. "Finding influential nodes via graph embedding and hybrid centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 194(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:200:y:2025:i:p3:s0960077925010720. 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.