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

Influential node identification by aggregating local structure information

Author

Listed:
  • Wang, Feifei
  • Sun, Zejun
  • Gan, Quan
  • Fan, Aiwan
  • Shi, Hesheng
  • Hu, Haifeng

Abstract

In complex networks, the identification of influential nodes is very important to study the transmission and control of viruses, the location of key points of network attacks, the spread of public opinion, and the marketing promotion of markets. Therefore, based on analysis of the existing algorithms for the identification of influential nodes in complex networks, this paper proposes a new method to identify influential nodes by aggregating local structure information (ALSI). This method considers two factors: the influence of the node itself and the influence contributed by the neighbor node. The degree and K-shell value of the node are introduced when calculating the influence of the node itself, and the degree and K-shell value of the neighbor node are introduced in the calculation of the influence contributed by the neighbor node. Different calculation methods are adopted according to the comparison result of the K-shell value with the node. The greater the K-shell value and the node degree are, the more important the node is. To evaluate the performance of the algorithm, the susceptible–infected–recovered (SIR) model is used to analyze and compare the running results of 9 algorithms on 8 different networks. The experimental results show that the proposed algorithm can effectively detect the influence of nodes and outperforms many state-of-the-art algorithms.

Suggested Citation

  • Wang, Feifei & Sun, Zejun & Gan, Quan & Fan, Aiwan & Shi, Hesheng & Hu, Haifeng, 2022. "Influential node identification by aggregating local structure information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 593(C).
    • Handle: RePEc:eee:phsmap:v:593:y:2022:i:c:s037843712200022x
    DOI: 10.1016/j.physa.2022.126885
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843712200022X
    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.126885?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. Fan Yang & Ruisheng Zhang & Zhao Yang & Rongjing Hu & Mengtian Li & Yongna Yuan & Keqin Li, 2017. "Identifying the most influential spreaders in complex networks by an Extended Local K-Shell Sum," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 28(01), pages 1-17, January.
    3. Cai Gao & Xin Lan & Xiaoge Zhang & Yong Deng, 2013. "A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-11, June.
    4. Yu, Hui & Cao, Xi & Liu, Zun & Li, Yongjun, 2017. "Identifying key nodes based on improved structural holes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 318-327.
    5. Wen, Tao & Jiang, Wen, 2019. "Identifying influential nodes based on fuzzy local dimension in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 119(C), pages 332-342.
    6. Xu, Runjie & Mi, Chuanmin & Mierzwiak, Rafał & Meng, Runyu, 2020. "Complex network construction of Internet finance risk," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    7. Zhao, Jie & Wang, Yunchuan & Deng, Yong, 2020. "Identifying influential nodes in complex networks from global perspective," Chaos, Solitons & Fractals, Elsevier, vol. 133(C).
    8. Yang, Jianmei & Yao, Canzhong & Ma, Weicheng & Chen, Guanrong, 2010. "A study of the spreading scheme for viral marketing based on a complex network model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(4), pages 859-870.
    9. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    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. 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).

    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. Gao, Shuai & Ma, Jun & Chen, Zhumin & Wang, Guanghui & Xing, Changming, 2014. "Ranking the spreading ability of nodes in complex networks based on local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 130-147.
    2. 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).
    3. Chaharborj, Sarkhosh Seddighi & Nabi, Khondoker Nazmoon & Feng, Koo Lee & Chaharborj, Shahriar Seddighi & Phang, Pei See, 2022. "Controlling COVID-19 transmission with isolation of influential nodes," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    4. Umed Temurshoev, 2008. "Who's Who in Networks. Wanted: the Key Group," Working Papers 08-08, NET Institute, revised Sep 2008.
    5. 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.
    6. 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).
    7. 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.
    8. 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).
    9. René van den Brink & Agnieszka Rusinowska, 2017. "The degree measure as utility function over positions in networks," Documents de travail du Centre d'Economie de la Sorbonne 17035, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    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. 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. Xu, Xiao-Ke & Wang, Xue & Xiao, Jing, 2018. "Inferring parent–child relationships by a node-remove centrality framework in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 505(C), pages 222-232.
    13. Li, Yongli & Wu, Chong & Wang, Xiaoyu & Luo, Peng, 2014. "A network-based and multi-parameter model for finding influential authors," Journal of Informetrics, Elsevier, vol. 8(3), pages 791-799.
    14. Gómez, Daniel & Figueira, José Rui & Eusébio, Augusto, 2013. "Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems," European Journal of Operational Research, Elsevier, vol. 226(2), pages 354-365.
    15. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    16. László Csató, 2017. "Measuring centrality by a generalization of degree," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 771-790, December.
    17. Zhang, Xiaohang & Cui, Huiyuan & Zhu, Ji & Du, Yu & Wang, Qi & Shi, Wenhua, 2017. "Measuring the dissimilarity of multiplex networks: An empirical study of international trade networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 467(C), pages 380-394.
    18. David L. Alderson & Daniel Funk & Ralucca Gera, 2020. "Analysis of the global maritime transportation system as a layered network," Journal of Transportation Security, Springer, vol. 13(3), pages 291-325, December.
    19. 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.
    20. 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).

    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:593:y:2022:i:c:s037843712200022x. 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.