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

Identifying influential nodes: A new method based on dynamic propagation probability model

Author

Listed:
  • Wang, Jinping
  • Sun, Shaowei

Abstract

Identifying influential nodes in complex networks persists as a crucial issue due to its practical applications in the real world. The propagation model is a special method for identifying influential nodes based on propagation dynamics. However, most of propagation-based methods have not delved deeply into the impact of network topology on the propagation process. In this paper, we propose a method based on the dynamic propagation probability model, called DPP. The main idea of this method is to characterize the impact of a node on the basis of its propagation capacity during propagation process by using dynamic propagation probability within its three level neighborhood. This new metric redefines the propagation probability of neighbors by refining the propagation process, which allows the propagation probability to be transmitted in accordance with the network structure. To validate the performance of the proposed method, we compare with eight different methods from four aspects in 11 real-world networks. The experimental results demonstrate that the DPP method has good performance in most cases.

Suggested Citation

  • Wang, Jinping & Sun, Shaowei, 2024. "Identifying influential nodes: A new method based on dynamic propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 185(C).
  • Handle: RePEc:eee:chsofr:v:185:y:2024:i:c:s0960077924007112
    DOI: 10.1016/j.chaos.2024.115159
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.chaos.2024.115159?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. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    2. 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.
    3. Liu, Jian-Guo & Ren, Zhuo-Ming & Guo, Qiang, 2013. "Ranking the spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(18), pages 4154-4159.
    4. 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).
    5. Zhao, Jie & Wang, Yunchuan & Deng, Yong, 2020. "Identifying influential nodes in complex networks from global perspective," Chaos, Solitons & Fractals, Elsevier, vol. 133(C).
    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. 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).
    8. Dimitrios Tsiotas & Serafeim Polyzos, 2015. "Analyzing the Maritime Transportation System in Greece: a Complex Network Approach," Networks and Spatial Economics, Springer, vol. 15(4), pages 981-1010, December.
    9. Akbarzadeh, Meisam & Salehi Reihani, Sayed Farzin & Samani, Keivan Aghababaei, 2019. "Detecting critical links of urban networks using cluster detection methods," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 288-298.
    10. 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).
    11. 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.
    12. Li, Meizhu & Zhang, Qi & Deng, Yong, 2018. "Evidential identification of influential nodes in network of networks," Chaos, Solitons & Fractals, Elsevier, vol. 117(C), pages 283-296.
    13. Tao Zhou & Linyuan Lü & Yi-Cheng Zhang, 2009. "Predicting missing links via local information," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 71(4), pages 623-630, October.
    14. 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.
    15. 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.
    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. 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).
    2. 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).
    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. 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).
    5. 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.
    6. 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.
    7. 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).
    8. 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.
    9. 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).
    10. Yeruva, Sujatha & Devi, T. & Reddy, Y. Samtha, 2016. "Selection of influential spreaders in complex networks using Pareto Shell decomposition," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 133-144.
    11. Ma, Ling-ling & Ma, Chuang & Zhang, Hai-Feng & Wang, Bing-Hong, 2016. "Identifying influential spreaders in complex networks based on gravity formula," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 205-212.
    12. Zhe Li & Xinyu Huang, 2023. "Identifying Influential Spreaders Using Local Information," Mathematics, MDPI, vol. 11(6), pages 1-14, March.
    13. 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.
    14. 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).
    15. Yu, Senbin & Gao, Liang & Xu, Lida & Gao, Zi-You, 2019. "Identifying influential spreaders based on indirect spreading in neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 418-425.
    16. 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.
    17. 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.
    18. Liu, Jia-Bao & Zheng, Ya-Qian & Lee, Chien-Chiang, 2024. "Statistical analysis of the regional air quality index of Yangtze River Delta based on complex network theory," Applied Energy, Elsevier, vol. 357(C).
    19. 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).
    20. 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.

    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:185:y:2024:i:c:s0960077924007112. 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.