Strong approximations for some open population epidemic models

1996 ◽  
Vol 33 (2) ◽  
pp. 448-457 ◽  
Author(s):  
Philip O'Neill

This paper considers a class of epidemic models in which susceptibles may enter or leave the population according to a general continuous time density dependent Markov chain. A sequence of such epidemics indexed by N, the initial number of susceptibles, is constructed on the same probability space as a time-inhomogeneous birth-and-death process. A coupling argument is then used to demonstrate the strong convergence of the sequence of infectives to the birth-and-death process. This result is used to provide a threshold analysis of the epidemic model in question.

1996 ◽  
Vol 33 (02) ◽  
pp. 448-457 ◽  
Author(s):  
Philip O'Neill

This paper considers a class of epidemic models in which susceptibles may enter or leave the population according to a general continuous time density dependent Markov chain. A sequence of such epidemics indexed by N, the initial number of susceptibles, is constructed on the same probability space as a time-inhomogeneous birth-and-death process. A coupling argument is then used to demonstrate the strong convergence of the sequence of infectives to the birth-and-death process. This result is used to provide a threshold analysis of the epidemic model in question.


1994 ◽  
Vol 31 (3) ◽  
pp. 606-613 ◽  
Author(s):  
V. M. Abramov

This paper considers the asymptotic distribution of the maximum number of infectives in an epidemic model by showing that, as the initial number of susceptibles converges to infinity, the process of infectives converges almost surely to a birth and death process. The model studied here is more general than usual (see e.g. Bailey (1975), Bharucha-Reid (1960), Keilson (1979)) in that it incorporates immigration and the limiting birth and death process is non-linear. The main novelty of the present paper is the martingale approach used to prove the above-mentioned convergence.


1994 ◽  
Vol 31 (03) ◽  
pp. 606-613
Author(s):  
V. M. Abramov

This paper considers the asymptotic distribution of the maximum number of infectives in an epidemic model by showing that, as the initial number of susceptibles converges to infinity, the process of infectives converges almost surely to a birth and death process. The model studied here is more general than usual (see e.g. Bailey (1975), Bharucha-Reid (1960), Keilson (1979)) in that it incorporates immigration and the limiting birth and death process is non-linear. The main novelty of the present paper is the martingale approach used to prove the above-mentioned convergence.


1994 ◽  
Vol 26 (03) ◽  
pp. 671-689
Author(s):  
Steven M. Butler

This paper describes the early and final properties of a general S–I–R epidemic process in which the infectives behave independently, each infective has a random number of contacts with the others in the population, and individuals vary in their susceptibility to infection. For the case of a large initial number of susceptibles and a small (finite) initial number of infectives, we derive the threshold behavior and the limiting distribution for the final state of the epidemic. Also, we show strong convergence of the epidemic process over any finite time interval to a birth and death process, extending the results of Ball (1983). These complement some results due to Butler (1994), who considers the case of a large initial number of infectives.


1981 ◽  
Vol 18 (01) ◽  
pp. 19-30 ◽  
Author(s):  
Robert Cogburn ◽  
William C. Torrez

A generalization to continuous time is given for a discrete-time model of a birth and death process in a random environment. Some important properties of this process in the continuous-time setting are stated and proved including instability and extinction conditions, and when suitable absorbing barriers have been defined, methods are given for the calculation of extinction probabilities and the expected duration of the process.


1991 ◽  
Vol 28 (01) ◽  
pp. 1-8 ◽  
Author(s):  
J. Gani ◽  
Gy. Michaletzky

This paper considers a carrier-borne epidemic in continuous time with m + 1 > 2 stages of infection. The carriers U(t) follow a pure death process, mixing homogeneously with susceptibles X 0(t), and infectives Xi (t) in stages 1≦i≦m of infection. The infectives progress through consecutive stages of infection after each contact with the carriers. It is shown that under certain conditions {X 0(t), X 1(t), · ··, Xm (t) U(t); t≧0} is an (m + 2)-variate Markov chain, and the partial differential equation for its probability generating function derived. This can be solved after a transfomation of variables, and the probability of survivors at the end of the epidemic found.


2020 ◽  
Vol 10 (1) ◽  
Author(s):  
F. Di Lauro ◽  
J.-C. Croix ◽  
M. Dashti ◽  
L. Berthouze ◽  
I. Z. Kiss

Abstract Using the continuous-time susceptible-infected-susceptible (SIS) model on networks, we investigate the problem of inferring the class of the underlying network when epidemic data is only available at population-level (i.e., the number of infected individuals at a finite set of discrete times of a single realisation of the epidemic), the only information likely to be available in real world settings. To tackle this, epidemics on networks are approximated by a Birth-and-Death process which keeps track of the number of infected nodes at population level. The rates of this surrogate model encode both the structure of the underlying network and disease dynamics. We use extensive simulations over Regular, Erdős–Rényi and Barabási–Albert networks to build network class-specific priors for these rates. We then use Bayesian model selection to recover the most likely underlying network class, based only on a single realisation of the epidemic. We show that the proposed methodology yields good results on both synthetic and real-world networks.


1998 ◽  
Vol 35 (3) ◽  
pp. 545-556 ◽  
Author(s):  
Masaaki Kijima

A continuous-time Markov chain on the non-negative integers is called skip-free to the right (left) if only unit increments to the right (left) are permitted. If a Markov chain is skip-free both to the right and to the left, it is called a birth–death process. Karlin and McGregor (1959) showed that if a continuous-time Markov chain is monotone in the sense of likelihood ratio ordering then it must be an (extended) birth–death process. This paper proves that if an irreducible Markov chain in continuous time is monotone in the sense of hazard rate (reversed hazard rate) ordering then it must be skip-free to the right (left). A birth–death process is then characterized as a continuous-time Markov chain that is monotone in the sense of both hazard rate and reversed hazard rate orderings. As an application, the first-passage-time distributions of such Markov chains are also studied.


2005 ◽  
Vol 46 (4) ◽  
pp. 485-493
Author(s):  
Emma Hunt

AbstractWe show that Algorithm H* for the determination of the rate matrix of a block-GI/M/1 Markov chain is related by duality to Algorithm H for the determination of the fundamental matrix of a block-M/G/1 Markov chain. Duality is used to generate some efficient algorithms for finding the rate matrix in a quasi-birth-and-death process.


Sign in / Sign up

Export Citation Format

Share Document