Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-25T23:13:28.787Z Has data issue: false hasContentIssue false
  • English
  • Français

Convergence and Monotonicity for a Model of Spontaneous Infection and Transmission

Part of: Markov processes Mathematical biology in general

Published online by Cambridge University Press:  22 February 2016

Eric Foxall
Eric Foxall*
Affiliation:
University of Victoria
*
∗ Postal address: Department of Mathematics and Statistics, University of Victoria, PO Box 3060 STN CSC, Victoria BC, V8W 3R4, Canada. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A version of the contact process (effectively an SIS model) on a finite set of sites is considered in which there is the possibility of spontaneous infection. A companion process is also considered in which spontaneous infection does not occur from the disease-free state. Monotonicity with respect to parameters and initial data is established, and conditions for irreducibility and exponential convergence of the processes are given. For the spontaneous process, a set of approximating equations is derived, and its properties investigated.

Keywords

Continuous-time Markov processinteracting particle systemSIS model

MSC classification

Primary: 60J25: Continuous-time Markov processes on general state spaces
Secondary: 92B99: None of the above, but in this section
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 46 , Issue 2 , June 2014 , pp. 560 - 584
Copyright
© Applied Probability Trust 

References

Berman, A. and Plemmons, R. J. (1994). Nonnegative Matrices in the Mathematical Sciences. Society for Industrial and Applied Mathematics, Philadelphia, PA.Google Scholar
Bubley, R. and Dyer, M. (1997). Path coupling: a technique for proving rapid mixing in Markov chains. In Proc. 38th Annual Symp. Foundations of Computer Science, pp. 223–231.Google Scholar
Harris, T. E. (1974). Contact interactions on a lattice. Ann. Prob. 2, 969–988.CrossRefGoogle Scholar
Harris, T. E. (1978). Additive set-valued Markov processes and graphical methods. Ann. Prob. 6, 355–378.CrossRefGoogle Scholar
Krone, S. M. (1999). The two-stage contact process. Ann. Appl. Prob. 9, 331–351.Google Scholar
Levin, D., Peres, Y. and Witmer, E. L. (2006). Markov Chains and Mixing Times. American Mathematical Society.Google Scholar
Neuhauser, C. (1992). Ergodic theorems for the multitype contact process. Prob. Theory Relat. Fields 91, 467–506.CrossRefGoogle Scholar
Norris, J. R. (1997). Markov Chains. Cambridge University Press.Google Scholar
Van Mieghem, P., Omic, J. and Kooij, R. (2009). Virus spread in networks. IEEE/ACM Trans. Networking 17, 1–14.Google Scholar