Skip to main content

Advertisement

Log in

A Covering-Graph Approach to Epidemics on SIS and SIS-Like Networks

  • Original Article
  • Published:
Bulletin of Mathematical Biology Aims and scope Submit manuscript

Abstract

In this paper, we introduce a new class of epidemics on networks which we call SI(S/I). SI(S/I) networks differ from SIS networks in allowing an infected individual to become reinfected without first passing to the susceptible state. We use a covering-graph construction to compare SIR, SIS, and SI(S/I) networks. Like the SIR networks that cover them, SI(S/I) networks exhibit infection probabilities that are monotone with respect to both transmission probabilities and the initial set of infectives. The same covering-graph construction allows us to characterize the recurrent states in an SIS or SI(S/I) network with reinfection.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Allen, L. J. S., & Burgin, A. M. (2000). Comparison of deterministic and stochastic SIS and SIR models in discrete time. Math. Biosci., 163(1), 1–33.

    Article  MathSciNet  MATH  Google Scholar 

  • Bailey, N. T. J. (1975) The mathematical theory of infectious diseases and its applications (2nd ed.). New York: Hafner Press

    MATH  Google Scholar 

  • Brauer, F. (2008). Compartmental models in epidemiology. In Mathematical epidemiology. Lecture Notes in Math. (Vol. 1945, pp. 19–79). Berlin: Springer.

    Chapter  Google Scholar 

  • Darroch, J. N., & Seneta, E. (1965). On quasi-stationary distributions in absorbing discrete-time finite Markov chains. J. Appl. Probab., 2, 88–100.

    Article  MathSciNet  MATH  Google Scholar 

  • Floyd, W., Kay, L., & Shapiro, M. (2008). Some elementary properties of SIR networks, or, Can I get sick because you got vaccinated? Bull. Math. Biol., 70(3), 713–727.

    Article  MathSciNet  MATH  Google Scholar 

  • Parshani, R., Dickison, M., Cohen, R., Stanley, H. E., & Havlin, S. (2010). Dynamic networks and directed percolation. Europhys. Lett., 90(3), 38004.

    Article  Google Scholar 

  • Shapiro, M., & Delgado-Eckert, E. (2010). Finding an individual’s probability of infection in an SIR network is NP-hard. http://arxiv.org/abs/1001.0595.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to William Floyd.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Floyd, W., Kay, L. & Shapiro, M. A Covering-Graph Approach to Epidemics on SIS and SIS-Like Networks. Bull Math Biol 74, 175–189 (2012). https://doi.org/10.1007/s11538-011-9684-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11538-011-9684-y

Keywords

Navigation