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

An efficient immunization strategy based on transmission limit in weighted complex networks

Author

Listed:
  • Shen, Dongqin
  • Cao, Shanshan

Abstract

The immunization strategy against the epidemic spreading in real world has attracted widespread attention of scientists from many different fields. However, the traditional immune behavior is achieved by deleting the edges in the network, which can lead to variations in the network structure and consequently serious damage to the efficiency of networks. In this paper, we studied a new type of immune strategy applied to weighted networks, which is to maintain the necessary network efficiency by limit the transmission(reduce the weight of edges) to suppress the spread of epidemic. It is similar to the inflammation around the infected parts of our body, which not only prevent epidemic from further spreading but also do no harm to the function of the body. We first set the rate of transmission be proportional to the edge weight according to the S–I epidemic spreading model. Then, we propose the specific dynamic evolution model for infected nodes that boosts efficient epidemic control. Theoretical analysis and simulation results indicate that the immunization strategy can efficaciously prevent the spread of the epidemic, while maintaining the high efficiency of the network.

Suggested Citation

  • Shen, Dongqin & Cao, Shanshan, 2018. "An efficient immunization strategy based on transmission limit in weighted complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 114(C), pages 1-7.
    • Handle: RePEc:eee:chsofr:v:114:y:2018:i:c:p:1-7
    DOI: 10.1016/j.chaos.2018.06.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077918303953
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2018.06.014?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. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    2. Chao Gao & Zhen Wang & Xianghua Li & Zili Zhang & Wei Zeng, 2016. "PR-Index: Using the h-Index and PageRank for Determining True Impact," PLOS ONE, Public Library of Science, vol. 11(9), pages 1-13, September.
    3. Chao Gao & Lu Zhong & Xianghua Li & Zili Zhang & Ning Shi, 2015. "Combination methods for identifying influential nodes in networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 26(06), pages 1-20.
    4. Li, Xianghua & Wang, Zhen & Gao, Chao & Shi, Lei, 2017. "Reasoning human emotional responses from large-scale social and public media," Applied Mathematics and Computation, Elsevier, vol. 310(C), pages 182-193.
    5. 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.
    6. Li, Li, 2015. "Patch invasion in a spatial epidemic model," Applied Mathematics and Computation, Elsevier, vol. 258(C), pages 342-349.
    7. Crucitti, Paolo & Latora, Vito & Marchiori, Massimo & Rapisarda, Andrea, 2003. "Efficiency of scale-free networks: error and attack tolerance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 320(C), pages 622-642.
    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. Wenyan Wang & Jun Zhang & Fang Zhou & Peng Chen & Bing Wang, 2021. "Paper acceptance prediction at the institutional level based on the combination of individual and network features," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(2), pages 1581-1597, February.
    2. Wei Duan, 2021. "Matrix-Based Formulation of Heterogeneous Individual-Based Models of Infectious Diseases: Using SARS Epidemic as a Case Study," IJERPH, MDPI, vol. 18(11), pages 1-20, May.
    3. Elisa Frutos Bernal & Angel Martín del Rey, 2019. "Study of the Structural and Robustness Characteristics of Madrid Metro Network," Sustainability, MDPI, vol. 11(12), pages 1-24, June.

    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. Li, Xianghua & Guo, Jingyi & Gao, Chao & Zhang, Leyan & Zhang, Zili, 2018. "A hybrid strategy for network immunization," Chaos, Solitons & Fractals, Elsevier, vol. 106(C), pages 214-219.
    2. Zhou, Yaoming & Wang, Junwei, 2018. "Efficiency of complex networks under failures and attacks: A percolation approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 658-664.
    3. Zhao, Jianyu & Wei, Jiang & Yu, Lean & Xi, Xi, 2022. "Robustness of knowledge networks under targeted attacks: Electric vehicle field of China evidence," Structural Change and Economic Dynamics, Elsevier, vol. 63(C), pages 367-382.
    4. Viljoen, Nadia M. & Joubert, Johan W., 2016. "The vulnerability of the global container shipping network to targeted link disruption," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 396-409.
    5. Morehead, Raymond & Noore, Afzel, 2007. "Novel hybrid mitigation strategy for improving the resiliency of hierarchical networks subjected to attacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(2), pages 603-612.
    6. Jalili, Mahdi, 2011. "Synchronizability of dynamical scale-free networks subject to random errors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4588-4595.
    7. Jalili, Mahdi, 2011. "Error and attack tolerance of small-worldness in complex networks," Journal of Informetrics, Elsevier, vol. 5(3), pages 422-430.
    8. Kashyap, G. & Ambika, G., 2019. "Link deletion in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 631-643.
    9. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    10. Lv, Changchun & Yuan, Ziwei & Si, Shubin & Duan, Dongli, 2021. "Robustness of scale-free networks with dynamical behavior against multi-node perturbation," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    11. Su, Zhen & Liu, Fanzhen & Gao, Chao & Gao, Shupeng & Li, Xianghua, 2018. "Inferring infection rate based on observations in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 107(C), pages 170-176.
    12. Aymeric Vié & Alfredo J. Morales, 2021. "How Connected is Too Connected? Impact of Network Topology on Systemic Risk and Collapse of Complex Economic Systems," Computational Economics, Springer;Society for Computational Economics, vol. 57(4), pages 1327-1351, April.
    13. 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).
    14. 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.
    15. Gao, Bo & Liu, Xuan & Lan, Zhongzhou & Fu, Rongrong, 2018. "A novel method for reconstructing period with single input in NFSR," Chaos, Solitons & Fractals, Elsevier, vol. 109(C), pages 36-40.
    16. Zhang, Jianhua & Wang, Shuliang & Wang, Xiaoyuan, 2018. "Comparison analysis on vulnerability of metro networks based on complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 72-78.
    17. L. Dijkstra & A. Yakushev & P. Duijn & A. Boukhanovsky & P. Sloot, 2014. "Inference of the Russian drug community from one of the largest social networks in the Russian Federation," Quality & Quantity: International Journal of Methodology, Springer, vol. 48(5), pages 2739-2755, September.
    18. Milena Oehlers & Benjamin Fabian, 2021. "Graph Metrics for Network Robustness—A Survey," Mathematics, MDPI, vol. 9(8), pages 1-48, April.
    19. Liu, Qing & Yang, Yang & Ng, Adolf K.Y. & Jiang, Changmin, 2023. "An analysis on the resilience of the European port network," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).
    20. Gao, Yan-Li & Chen, Shi-Ming & Nie, Sen & Ma, Fei & Guan, Jun-Jie, 2018. "Robustness analysis of interdependent networks under multiple-attacking strategies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 495-504.

    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:114:y:2018:i:c:p:1-7. 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.