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

An efficient algorithm for mining a set of influential spreaders in complex networks

Author

Listed:
  • Jiang, Lincheng
  • Zhao, Xiang
  • Ge, Bin
  • Xiao, Weidong
  • Ruan, Yirun

Abstract

Identifying the influential nodes in social network is of significance for information spreading, virus control and contagious disease detection. In this paper, the problem of influential spreaders selection is transferred into a problem to find groups with dense connections. Inspired by the fact that the network clustering coefficient would increase with the removal of peripheral nodes by the k-shell decomposition method, we select nodes with the highest k-shell value and interconnected with each other as the core to form an initial group. Then the neighbour nodes closely connected to the group are gradually added into it. The most influential node identified by degree centrality in each dense group would finally be selected as the initial spreaders and the k-shell value of all nodes in the group are set to 0 before searching for the next group. Therefore, the proposed method can guarantee not only the spreaders themselves are influential, but also the distance among them is relatively scattered. The experimental results in six real networks indicate that the spreaders identified by the method are more influential than several benchmark algorithms, including the discount degree method, VoteRank, LIR, k-shell and degree centrality.

Suggested Citation

  • Jiang, Lincheng & Zhao, Xiang & Ge, Bin & Xiao, Weidong & Ruan, Yirun, 2019. "An efficient algorithm for mining a set of influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 58-65.
    • Handle: RePEc:eee:phsmap:v:516:y:2019:i:c:p:58-65
    DOI: 10.1016/j.physa.2018.10.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118313499
    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.2018.10.011?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. 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.
    2. Yandong Xiao & Songyang Lao & Lvlin Hou & Michael Small & Liang Bai, 2015. "Effects of Edge Directions on the Structural Controllability of Complex Networks," PLOS ONE, Public Library of Science, vol. 10(8), pages 1-15, August.
    3. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2012. "Self-similar scaling of density in complex real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2794-2802.
    4. Li, Chao & Wang, Li & Sun, Shiwen & Xia, Chengyi, 2018. "Identification of influential spreaders based on classified neighbors in real-world complex networks," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 512-523.
    5. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    6. Li, Hui-Jia & Bu, Zhan & Li, Yulong & Zhang, Zhongyuan & Chu, Yanchang & Li, Guijun & Cao, Jie, 2018. "Evolving the attribute flow for dynamical clustering in signed networks," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 20-27.
    7. Robert M. Bond & Christopher J. Fariss & Jason J. Jones & Adam D. I. Kramer & Cameron Marlow & Jaime E. Settle & James H. Fowler, 2012. "A 61-million-person experiment in social influence and political mobilization," Nature, Nature, vol. 489(7415), pages 295-298, September.
    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. Wang, Ying & Zheng, Yunan & Shi, Xuelei & Liu, Yiguang, 2022. "An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 588(C).
    2. Zhang, Jun-li & Fu, Yan-jun & Cheng, Lan & Yang, Yun-yun, 2021. "Identifying multiple influential spreaders based on maximum connected component decomposition method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
    3. 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).
    4. Zhao, Jie & Wang, Yunchuan & Deng, Yong, 2020. "Identifying influential nodes in complex networks from global perspective," Chaos, Solitons & Fractals, Elsevier, vol. 133(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. Wang, Zhishuang & Guo, Quantong & Sun, Shiwen & Xia, Chengyi, 2019. "The impact of awareness diffusion on SIR-like epidemics in multiplex networks," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 134-147.
    2. Agryzkov, Taras & Tortosa, Leandro & Vicent, Jose F., 2019. "A variant of the current flow betweenness centrality and its application in urban networks," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 600-615.
    3. Wang, Weiping & Guo, Junjiang & Wang, Zhen & Wang, Hao & Cheng, Jun & Wang, Chunyang & Yuan, Manman & Kurths, Jürgen & Luo, Xiong & Gao, Yang, 2021. "Abnormal flow detection in industrial control network based on deep reinforcement learning," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    4. Keng, Ying Ying & Kwa, Kiam Heong & Ratnavelu, Kurunathan, 2021. "Centrality analysis in a drug network and its application to drug repositioning," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    5. Giacopelli, G. & Migliore, M. & Tegolo, D., 2020. "Graph-theoretical derivation of brain structural connectivity," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    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. Curado, Manuel & Tortosa, Leandro & Vicent, Jose F., 2021. "Identifying mobility patterns by means of centrality algorithms in multiplex networks," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    8. da Cunha, Éverton Fernandes & da Fontoura Costa, Luciano, 2022. "On hypercomplex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    9. Liu, Xiaoxiao & Sun, Shiwen & Wang, Jiawei & Xia, Chengyi, 2019. "Onion structure optimizes attack robustness of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    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. Xu, Paiheng & Zhang, Rong & Deng, Yong, 2018. "A novel visibility graph transformation of time series into weighted networks," Chaos, Solitons & Fractals, Elsevier, vol. 117(C), pages 201-208.
    12. Zhu, Linhe & Liu, Mengxue & Li, Yimin, 2019. "The dynamics analysis of a rumor propagation model in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 118-137.
    13. Li, Huichun & Zhang, Xue & Zhao, Chengli, 2021. "Explaining social events through community evolution on temporal networks," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    14. Yao, Hongxing & Memon, Bilal Ahmed, 2019. "Network topology of FTSE 100 Index companies: From the perspective of Brexit," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1248-1262.
    15. Wang, Ze & Gao, Xiangyun & Tang, Renwu & Liu, Xueyong & Sun, Qingru & Chen, Zhihua, 2019. "Identifying influential nodes based on fluctuation conduction network model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 355-369.
    16. Liu, Wanping & Wu, Xiao & Yang, Wu & Zhu, Xiaofei & Zhong, Shouming, 2019. "Modeling cyber rumor spreading over mobile social networks: A compartment approach," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 214-229.
    17. Bodaghi, Amirhosein & Goliaei, Sama & Salehi, Mostafa, 2019. "The number of followings as an influential factor in rumor spreading," Applied Mathematics and Computation, Elsevier, vol. 357(C), pages 167-184.
    18. Johnson, Nathan & Turnbull, Benjamin & Reisslein, Martin, 2022. "Social media influence, trust, and conflict: An interview based study of leadership perceptions," Technology in Society, Elsevier, vol. 68(C).
    19. Alan Gerber & Mitchell Hoffman & John Morgan & Collin Raymond, 2020. "One in a Million: Field Experiments on Perceived Closeness of the Election and Voter Turnout," American Economic Journal: Applied Economics, American Economic Association, vol. 12(3), pages 287-325, July.
    20. Kenju Kamei & Louis Putterman & Jean-Robert Tyran, 2019. "Civic Engagement as a Second-Order Public Good: The Cooperative Underpinnings of the Accountable State," Discussion Papers 19-10, University of Copenhagen. Department of Economics.

    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:516:y:2019:i:c:p:58-65. 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.