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

Influential nodes identification based on Quasi-Laplacian Gravity Model

Author

Listed:
  • Liu, Yan
  • Wang, Bin
  • Zhang, Simeng
  • Tian, Pengxu
  • Zhang, Hexin
  • Liu, Chenlu
  • Jiang, Xinyan

Abstract

Identifying influential nodes, which play a critical role in the structure and dynamics of complex networks, is a fundamental problem in network analysis. While numerous centrality measures have been developed to address this challenge, most existing methods either focus solely on local or global structural information, or lack the flexibility to incorporate additional network features. Moreover, traditional approaches often struggle to adapt to the diverse and complex nature of real-world networks, limiting their effectiveness in accurately capturing node influence. In this study, we propose the Quasi-Laplacian Gravity Model (QLGM), a novel approach that integrates the Quasi-Laplacian matrix with Gravity Model principles to provide a more comprehensive assessment of node influence. The flexibility of QLGM allows it to serve as a general and extensible framework, capable of incorporating diverse network features and existing centrality measures. By integrating these additional sources of information, QLGM not only enhances the performance of traditional and modern centrality methods but also adapts effectively to various network structures. Experimental results on a range of real-world networks demonstrate the effectiveness and adaptability of the QLGM in the identification of influential nodes.

Suggested Citation

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

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.chaos.2025.117159?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, Jinping & Sun, Shaowei, 2024. "Comment on the paper “Identifying critical nodes in complex networks based on distance Laplacian energy”," Chaos, Solitons & Fractals, Elsevier, vol. 187(C).
    2. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    3. 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.
    4. Jackson, Matthew O. & Watts, Alison, 2002. "The Evolution of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 106(2), pages 265-295, October.
    5. 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).
    6. Lordan, Oriol & Sallan, Jose M. & Escorihuela, Nuria & Gonzalez-Prieto, David, 2016. "Robustness of airline route networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 445(C), pages 18-26.
    7. Lordan, Oriol & Sallan, Jose M. & Simo, Pep, 2014. "Study of the topology and robustness of airline route networks from the complex network approach: a survey and research agenda," Journal of Transport Geography, Elsevier, vol. 37(C), pages 112-120.
    8. Yin, Rongrong & Li, Linhui & Wang, Yumeng & Lang, Chun & Hao, Zhenyang & Zhang, Le, 2024. "Response to the comment on “Identifying critical nodes in complex networks based on distance Laplacian energy”," Chaos, Solitons & Fractals, Elsevier, vol. 187(C).
    9. Zhu, Xiaoyu & Hao, Rongxia, 2024. "Identifying influential nodes in social networks via improved Laplacian centrality," Chaos, Solitons & Fractals, Elsevier, vol. 189(P1).
    10. 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.
    11. Flaviano Morone & Hernán A. Makse, 2015. "Correction: Corrigendum: Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 527(7579), pages 544-544, November.
    12. Flaviano Morone & Hernán A. Makse, 2015. "Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 524(7563), pages 65-68, August.
    13. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    14. Stephany Rajeh & Marinette Savonnet & Eric Leclercq & Hocine Cherifi, 2023. "Comparative evaluation of community-aware centrality measures," Quality & Quantity: International Journal of Methodology, Springer, vol. 57(2), pages 1273-1302, April.
    15. Stephen Eubank & Hasan Guclu & V. S. Anil Kumar & Madhav V. Marathe & Aravind Srinivasan & Zoltán Toroczkai & Nan Wang, 2004. "Modelling disease outbreaks in realistic urban social networks," Nature, Nature, vol. 429(6988), pages 180-184, May.
    16. 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.
    17. Ma, Yue & Cao, Zhulou & Qi, Xingqin, 2019. "Quasi-Laplacian centrality: A new vertex centrality measurement based on Quasi-Laplacian energy of networks," 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. Wang, Jinping & Sun, Shaowei, 2025. "Identifying influential nodes in complex networks based on closeness energy," Chaos, Solitons & Fractals, Elsevier, vol. 200(P2).
    2. Zhu, Xiaoyu & Hao, Rongxia, 2024. "Identifying influential nodes in social networks via improved Laplacian centrality," Chaos, Solitons & Fractals, Elsevier, vol. 189(P1).
    3. 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).
    4. Wang, Jinping & Sun, Shaowei, 2024. "Identifying influential nodes: A new method based on dynamic propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 185(C).
    5. Ahmad, Waseem & Wang, Bang, 2024. "A neural diffusion model for identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 189(P1).
    6. Ullah, Aman & Meng, Yahui, 2025. "Finding influential nodes via graph embedding and hybrid centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 194(C).
    7. 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).
    8. 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).
    9. Zhe Li & Xinyu Huang, 2023. "Identifying Influential Spreaders Using Local Information," Mathematics, MDPI, vol. 11(6), pages 1-14, March.
    10. 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.
    11. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    12. 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.
    13. 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.
    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. 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).
    16. Bao, Zhong-Kui & Ma, Chuang & Xiang, Bing-Bing & Zhang, Hai-Feng, 2017. "Identification of influential nodes in complex networks: Method from spreading probability viewpoint," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 468(C), pages 391-397.
    17. 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.
    18. Sun, Peng Gang & Che, Wanping & Quan, Yining & Wang, Shuzhen & Miao, Qiguang, 2022. "Random networks are heterogeneous exhibiting a multi-scaling law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 587(C).
    19. 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).
    20. Wu, Jian & Qiu, Tian & Chen, Guang, 2024. "A general deep-learning approach to node importance identification," Chaos, Solitons & Fractals, Elsevier, vol. 188(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:s0960077925011725. 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.