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

Identification of node centrality based on Laplacian energy of networks

Author

Listed:
  • Zhao, Shuying
  • Sun, Shaowei

Abstract

Identifying influential spreaders in complex networks is a crucial issue that can help control the propagation process in complex networks. Existing methods propose substantial improvements over many classical centrality methods. Over the years, some researchers have applied concepts of graph energy to node recognition. Based on this, we propose a new node centrality — the third Laplacian energy centrality (LC). This method is to define the centrality of nodes from a global perspective and can be simplified into a local formula while inheriting the advantages of the global property, which greatly reduces the time complexity. By assuming that the propagation process in the network follows a susceptible–infected–recovery (SIR) model, we conduct extensive experiments in 13 real networks, and compare the performance of LC with a range of other centrality measures. The results show that LC is more reasonable and superior than other methods in identifying influential spreaders.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:phsmap:v:609:y:2023:i:c:s0378437122009116
    DOI: 10.1016/j.physa.2022.128353
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437122009116
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2022.128353?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. 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. 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).
    4. Duan-Bing Chen & Hui Gao & Linyuan Lü & Tao Zhou, 2013. "Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering," PLOS ONE, Public Library of Science, vol. 8(10), pages 1-10, October.
    5. Wang, Zhuoyang & Chen, Guo & Liu, Long & Hill, David J., 2020. "Cascading risk assessment in power-communication interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    6. Linyuan Lü & Yi-Cheng Zhang & Chi Ho Yeung & Tao Zhou, 2011. "Leaders in Social Networks, the Delicious Case," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-9, June.
    7. Karen E Joyce & Paul J Laurienti & Jonathan H Burdette & Satoru Hayasaka, 2010. "A New Measure of Centrality for Brain Networks," PLOS ONE, Public Library of Science, vol. 5(8), pages 1-13, August.
    8. Stephen P. Borgatti, 2006. "Identifying sets of key players in a social network," Computational and Mathematical Organization Theory, Springer, vol. 12(1), pages 21-34, April.
    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. Zhe Li & Xinyu Huang, 2023. "Identifying Influential Spreaders Using Local Information," Mathematics, MDPI, vol. 11(6), pages 1-14, March.

    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, 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.
    2. 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.
    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. 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.
    7. 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.
    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. Teqi Dai & Tiantian Ding & Qingfang Liu & Bingxin Liu, 2022. "Node Centrality Comparison between Bus Line and Passenger Flow Networks in Beijing," Sustainability, MDPI, vol. 14(22), pages 1-14, November.
    10. Yupeng Li & Zhaotong Wang & Xiaoyu Zhong & Fan Zou, 2019. "Identification of influential function modules within complex products and systems based on weighted and directed complex networks," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2375-2390, August.
    11. 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.
    12. Kathy Fogel & Liping Ma & Randall Morck, 2021. "Powerful independent directors," Financial Management, Financial Management Association International, vol. 50(4), pages 935-983, December.
    13. Sheng, Jinfang & Dai, Jinying & Wang, Bin & Duan, Guihua & Long, Jun & Zhang, Junkai & Guan, Kerong & Hu, Sheng & Chen, Long & Guan, Wanghao, 2020. "Identifying influential nodes in complex networks based on global and local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 541(C).
    14. 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).
    15. Zhe Li & Xinyu Huang, 2023. "Identifying Influential Spreaders Using Local Information," Mathematics, MDPI, vol. 11(6), pages 1-14, March.
    16. Xia, Ling-Ling & Song, Yu-Rong & Li, Chan-Chan & Jiang, Guo-Ping, 2018. "Improved targeted immunization strategies based on two rounds of selection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 540-547.
    17. Mahyar, Hamidreza & Hasheminezhad, Rouzbeh & Ghalebi K., Elahe & Nazemian, Ali & Grosu, Radu & Movaghar, Ali & Rabiee, Hamid R., 2018. "Compressive sensing of high betweenness centrality nodes in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 166-184.
    18. 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).
    19. 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.
    20. Andrea Landherr & Bettina Friedl & Julia Heidemann, 2010. "A Critical Review of Centrality Measures in Social Networks," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 2(6), pages 371-385, December.

    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:phsmap:v:609:y:2023:i:c:s0378437122009116. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.