scholarly journals Open Markov Type Population Models: From Discrete to Continuous Time

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1496
Author(s):  
Manuel L. Esquível ◽  
Nadezhda P. Krasii ◽  
Gracinda R. Guerreiro

We address the problem of finding a natural continuous time Markov type process—in open populations—that best captures the information provided by an open Markov chain in discrete time which is usually the sole possible observation from data. Given the open discrete time Markov chain, we single out two main approaches: In the first one, we consider a calibration procedure of a continuous time Markov process using a transition matrix of a discrete time Markov chain and we show that, when the discrete time transition matrix is embeddable in a continuous time one, the calibration problem has optimal solutions. In the second approach, we consider semi-Markov processes—and open Markov schemes—and we propose a direct extension from the discrete time theory to the continuous time one by using a known structure representation result for semi-Markov processes that decomposes the process as a sum of terms given by the products of the random variables of a discrete time Markov chain by time functions built from an adequate increasing sequence of stopping times.

1975 ◽  
Vol 12 (1) ◽  
pp. 161-163 ◽  
Author(s):  
Richard L. Tweedie

It is shown that methods used by the author to approximate limit probabilities for Markov processes from their Q-matrices extend to semi-Markov processes. The limit probabilities for semi-Markov processes can be approximated using only truncations of the embedded Markov chain transition matrix and the vector of mean holding times.


2012 ◽  
Vol 26 (4) ◽  
pp. 483-508 ◽  
Author(s):  
Michael N. Katehakis ◽  
Laurens C. Smit

A class of Markov chains we call successively lumbaple is specified for which it is shown that the stationary probabilities can be obtained by successively computing the stationary probabilities of a propitiously constructed sequence of Markov chains. Each of the latter chains has a(typically much) smaller state space and this yields significant computational improvements. We discuss how the results for discrete time Markov chains extend to semi-Markov processes and continuous time Markov processes. Finally, we will study applications of successively lumbaple Markov chains to classical reliability and queueing models.


2002 ◽  
Vol 34 (01) ◽  
pp. 241-259
Author(s):  
Félix Belzunce ◽  
Eva-María Ortega ◽  
José M. Ruiz

The purpose of this paper is to study ageing properties of first-passage times of increasing Markov chains. We extend the literature to some new ageing classes, such as the IFR(2), NBU(2), DRLLt and NBULt classes. We also give sufficient conditions in the finite case, that are more efficient computationally, just in terms of the transition matrix K, in the discrete case, or the generator matrix Q, in the continuous case. For the uniformizable, continuous-time Markov processes, we derive conditions in terms of the discrete uniformized Markov chain for the NBU(2) and the NBULt classes. In the last section, a review of the main results in this direction in the literature is given, and we compare some of the conditions stated in this paper with others given in the literature about some other ageing classes. Some examples where these results are applied are given.


2002 ◽  
Vol 34 (1) ◽  
pp. 241-259 ◽  
Author(s):  
Félix Belzunce ◽  
Eva-María Ortega ◽  
José M. Ruiz

The purpose of this paper is to study ageing properties of first-passage times of increasing Markov chains. We extend the literature to some new ageing classes, such as the IFR(2), NBU(2), DRLLt and NBULt classes. We also give sufficient conditions in the finite case, that are more efficient computationally, just in terms of the transition matrix K, in the discrete case, or the generator matrix Q, in the continuous case. For the uniformizable, continuous-time Markov processes, we derive conditions in terms of the discrete uniformized Markov chain for the NBU(2) and the NBULt classes. In the last section, a review of the main results in this direction in the literature is given, and we compare some of the conditions stated in this paper with others given in the literature about some other ageing classes. Some examples where these results are applied are given.


1975 ◽  
Vol 12 (01) ◽  
pp. 161-163 ◽  
Author(s):  
Richard L. Tweedie

It is shown that methods used by the author to approximate limit probabilities for Markov processes from their Q-matrices extend to semi-Markov processes. The limit probabilities for semi-Markov processes can be approximated using only truncations of the embedded Markov chain transition matrix and the vector of mean holding times.


1988 ◽  
Vol 2 (3) ◽  
pp. 377-382 ◽  
Author(s):  
Peter W. Glynn ◽  
Donald L. Iglehart

Analysis of the initial transient problem of Monte Carlo steady-state simulation motivates the following question for Markov chains: when does there exist a deterministic Tsuch that P{X(T) = y|(0) = x} = ®(y), where ρ is the stationary distribution of X? We show that this can essentially never happen for a continuous-time Markov chain; in discrete time, such processes are i.i.d. provided the transition matrix is diagonalizable.


2003 ◽  
Vol 40 (2) ◽  
pp. 361-375 ◽  
Author(s):  
A. Irle

We consider the following ordering for stochastic processes as introduced by Irle and Gani (2001). A process (Yt)t is said to be slower in level crossing than a process (Zt)t if it takes (Yt)t stochastically longer than (Zt)t to exceed any given level. In Irle and Gani (2001), this ordering was investigated for Markov chains in discrete time. Here these results are carried over to semi-Markov processes with particular attention to birth-and-death processes and also to Wiener processes.


2003 ◽  
Vol 40 (02) ◽  
pp. 361-375 ◽  
Author(s):  
A. Irle

We consider the following ordering for stochastic processes as introduced by Irle and Gani (2001). A process (Y t ) t is said to be slower in level crossing than a process (Z t ) t if it takes (Y t ) t stochastically longer than (Z t ) t to exceed any given level. In Irle and Gani (2001), this ordering was investigated for Markov chains in discrete time. Here these results are carried over to semi-Markov processes with particular attention to birth-and-death processes and also to Wiener processes.


2002 ◽  
Vol 11 (1) ◽  
pp. 33-42 ◽  
Author(s):  
Bruce A. Craig ◽  
Peter P. Sendi

Sign in / Sign up

Export Citation Format

Share Document