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

Identifying and ranking influential spreaders in complex networks with consideration of spreading probability

Author

Listed:
  • Ma, Qian
  • Ma, Jun

Abstract

Identifying the influential spreaders in complex network has great theoretical and practical significance. In order to evaluate the spreading ability of the nodes, some centrality measures are usually computed, which include degree centrality (DC), betweenness centrality (BC), closeness centrality (CC), k-shell centrality (KS) and local centrality (LC). However, we observe that the performance of different centrality measures may change when these measures are used in a real network with different spreading probabilities. Specifically, DC performs well for small spreading probabilities and LC is more suitable for larger ones. To alleviate the sensitivity of these centrality measures to the spreading probability, we modify LC and then integrate it with DC by considering the spreading probability. We call the proposed measure hybrid degree centrality (HC). HC can take the advantages of DC or LC depending on the given spreading probability. We use SIR model to evaluate the performance of HC in both real networks and artificial networks. Experimental results show that HC performs robustly under different spreading probabilities. Compared with these known centrality measures such as DC, LC, BC, CC and KS, HC can evaluate the spreading ability of the nodes more accurately on most range of spreading probabilities. Furthermore, we show that our method can better distinguish the spreading ability of nodes.

Suggested Citation

  • Ma, Qian & Ma, Jun, 2017. "Identifying and ranking influential spreaders in complex networks with consideration of spreading probability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 312-330.
    • Handle: RePEc:eee:phsmap:v:465:y:2017:i:c:p:312-330
    DOI: 10.1016/j.physa.2016.08.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116305581
    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.2016.08.041?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. Cho, Youngsang & Hwang, Junseok & Lee, Daeho, 2012. "Identification of effective opinion leaders in the diffusion of technological innovation: A social network approach," Technological Forecasting and Social Change, Elsevier, vol. 79(1), pages 97-106.
    2. 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.
    3. 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.
    4. Hou, Bonan & Yao, Yiping & Liao, Dongsheng, 2012. "Identifying all-around nodes for spreading dynamics in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(15), pages 4012-4017.
    5. 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.
    6. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    7. Chen, Duanbing & Lü, Linyuan & Shang, Ming-Sheng & Zhang, Yi-Cheng & Zhou, Tao, 2012. "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1777-1787.
    8. Li, Qian & Zhou, Tao & Lü, Linyuan & Chen, Duanbing, 2014. "Identifying influential spreaders by weighted LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 47-55.
    9. Flaviano Morone & Hernán A. Makse, 2015. "Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 524(7563), pages 65-68, August.
    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. Malang, Kanokwan & Wang, Shuliang & Phaphuangwittayakul, Aniwat & Lv, Yuanyuan & Yuan, Hanning & Zhang, Xiuzhen, 2020. "Identifying influential nodes of global terrorism network: A comparison for skeleton network extraction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    2. 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.
    3. Lv, Zhiwei & Zhao, Nan & Xiong, Fei & Chen, Nan, 2019. "A novel measure of identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 488-497.
    4. Shang, Jiaxing & Wu, Hongchun & Zhou, Shangbo & Zhong, Jiang & Feng, Yong & Qiang, Baohua, 2018. "IMPC: Influence maximization based on multi-neighbor potential in community networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1085-1103.
    5. Devi, Kalyanee & Tripathi, Rohit, 2023. "ASN: A method of optimality for seed identification in the influence diffusion process," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 618(C).
    6. 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).
    7. Liu, Qiang & Zhu, Yu-Xiao & Jia, Yan & Deng, Lu & Zhou, Bin & Zhu, Jun-Xing & Zou, Peng, 2018. "Leveraging local h-index to identify and rank influential spreaders in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 379-391.
    8. 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.
    9. 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).

    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. Liu, Yang & Wei, Bo & Du, Yuxian & Xiao, Fuyuan & Deng, Yong, 2016. "Identifying influential spreaders by weight degree centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 86(C), pages 1-7.
    3. Wei, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    4. Fu, Yu-Hsiang & Huang, Chung-Yuan & Sun, Chuen-Tsai, 2015. "Using global diversity and local topology features to identify influential network spreaders," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 433(C), pages 344-355.
    5. Lv, Zhiwei & Zhao, Nan & Xiong, Fei & Chen, Nan, 2019. "A novel measure of identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 488-497.
    6. 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.
    7. 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).
    8. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Zareie, Ahmad, 2017. "Identification of influential users by neighbors in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 517-534.
    9. 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.
    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, Tinghuai & Yue, Mingliang & Qu, Jingjing & Tian, Yuan & Al-Dhelaan, Abdullah & Al-Rodhaan, Mznah, 2018. "PSPLPA: Probability and similarity based parallel label propagation algorithm on spark," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 366-378.
    12. 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.
    13. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    14. 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.
    15. Liu, Jun & Xiong, Qingyu & Shi, Weiren & Shi, Xin & Wang, Kai, 2016. "Evaluating the importance of nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 209-219.
    16. 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.
    17. Liu, Ying & Tang, Ming & Zhou, Tao & Do, Younghae, 2016. "Identify influential spreaders in complex networks, the role of neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 289-298.
    18. Fei, Liguo & Zhang, Qi & Deng, Yong, 2018. "Identifying influential nodes in complex networks based on the inverse-square law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1044-1059.
    19. Xiaojian Ma & Yinghong Ma, 2019. "The Local Triangle Structure Centrality Method to Rank Nodes in Networks," Complexity, Hindawi, vol. 2019, pages 1-16, January.
    20. 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).

    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:465:y:2017:i:c:p:312-330. 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.