Export citation

Export citation

Choose format for download:

Download Citation
  • Access by Xinjiang University

Burst of virus infection and a possibly largest epidemic threshold of non-Markovian susceptible-infected-susceptible processes on networks

Qiang Liu* and Piet Van Mieghem

  • Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands

  • *Q.L.Liu@tudelft.nl
  • P.F.A.VanMieghem@TUDelft.nl

Phys. Rev. E 97, 022309 – Published 20 February, 2018

DOI: https://doi.org/10.1103/PhysRevE.97.022309

Abstract

Since a real epidemic process is not necessarily Markovian, the epidemic threshold obtained under the Markovian assumption may be not realistic. To understand general non-Markovian epidemic processes on networks, we study the Weibullian susceptible-infected-susceptible (SIS) process in which the infection process is a renewal process with a Weibull time distribution. We find that, if the infection rate exceeds 1/ln(λ1+1), where λ1 is the largest eigenvalue of the network's adjacency matrix, then the infection will persist on the network under the mean-field approximation. Thus, 1/ln(λ1+1) is possibly the largest epidemic threshold for a general non-Markovian SIS process with a Poisson curing process under the mean-field approximation. Furthermore, non-Markovian SIS processes may result in a multimodal prevalence. As a byproduct, we show that a limiting Weibullian SIS process has the potential to model bursts of a synchronized infection.

Physics Subject Headings (PhySH)

Article Text

References (20)

  1. R. Pastor-Satorras, C. Castellano, P. Van Mieghem, and A. Vespignani, Rev. Mod. Phys. 87, 925 (2015).
  2. P. Van Mieghem, arXiv:1310.3980 (2013).
  3. P. Van Mieghem, J. Omic, and R. Kooij, IEEE/ACM Trans. Netw. 17, 1 (2009).
  4. R. Pastor-Satorras and A. Vespignani, Phys. Rev. Lett. 86, 3200 (2001).
  5. P. Van Mieghem, Computing 93, 147 (2011).
  6. P. Van Mieghem and R. van de Bovenkamp, Phys. Rev. Lett. 110, 108701 (2013).
  7. C. Doerr, N. Blenn, and P. Van Mieghem, PloS One 8, e64349 (2013).
  8. P. Van Mieghem, Performance Analysis of Complex Networks and Systems (Cambridge University, Cambridge, England, 2014).
  9. E. Cator, R. van de Bovenkamp, and P. Van Mieghem, Phys. Rev. E 87, 062816 (2013).
  10. A. Vazquez, B. Racz, A. Lukacs, and A.-L. Barabasi, Phys. Rev. Lett. 98, 158702 (2007).
  11. J. W. Tang, K. L. Ngai, W. Y. Lam, and P. K. Chan, PLoS One 3, e2768 (2008).
  12. D. J. Watts, R. Muhamad, D. C. Medina, and P. S. Dodds, Proc. Natl. Acad. Sci. USA 102, 11157 (2005).
  13. Z.-D. Zhao, Y. Liu, and M. Tang, Chaos 22, 023150 (2012).
  14. H. J. Ahn and B. Hassibi, in 2013 IEEE 52nd Annual Conference on Decision and Control (CDC) (IEEE, New York, 2013), pp. 4579–4585.
  15. D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos, ACM Trans. Inf. Syst. Secur. 10, 1 (2008).
  16. C. I. Del Genio, T. Gross, and K. E. Bassler, Phys. Rev. Lett. 107, 178701 (2011).
  17. F. Chung, L. Lu, and V. Vu, Ann. Comb. 7, 21 (2003).
  18. Q. Liu and P. Van Mieghem, in International Workshop on Complex Networks and their Applications (Springer, New York, 2016), pp. 511–521.
  19. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables (Dover Publications Inc., New York, 1964).
  20. P. Van Mieghem, Graph Spectra for Complex Networks (Cambridge University, Cambridge, England, 2010).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation