In this paper, the aim is to study similarities and differences between a continuous-time Markov chain and its uniformized Markov chains and discrete skeletons in terms of first passage times when the taboo subset of states is assumed to be accessible from a class of communicating states. Under the assumption of a finite communicating class, we characterize the first-passage times in terms of either continuous or discrete phase-type random variables. For illustrative purposes, we show how first passage times in uniformized Markov chains and discrete skeletons can be used to approximate the random duration of an outbreak in the SIS epidemic model
Markov chains have famously been a crucial tool in understanding stochastic processes and queuing sy...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...
Let (X,Px) be a continuous time Markov chain with finite or countable state space S and let T be its...
AbstractIn an earlier paper [J.J. Hunter, Mixing times with applications to perturbed Markov chains,...
Consider a stochastically monotone chain with monotone paths on a partially ordered countable set S....
Abstract. Let (X,Px) be a continuous time Markov chain with finite or count-able state space S and l...
peer-reviewedContinuous-time Markov process models of contagions are widely studied, not least becau...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
In an earlier paper the author introduced the statisticηi j ijπ j m = m = Σ 1 as a measure of the ...
A numerical method to approximate first passage times distributions in direct Markov processes will...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...
AbstractA measure of the “mixing time” or “time to stationarity” in a finite irreducible discrete ti...
Markov chains have famously been a crucial tool in understanding stochastic processes and queuing sy...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...
Let (X,Px) be a continuous time Markov chain with finite or countable state space S and let T be its...
AbstractIn an earlier paper [J.J. Hunter, Mixing times with applications to perturbed Markov chains,...
Consider a stochastically monotone chain with monotone paths on a partially ordered countable set S....
Abstract. Let (X,Px) be a continuous time Markov chain with finite or count-able state space S and l...
peer-reviewedContinuous-time Markov process models of contagions are widely studied, not least becau...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
In an earlier paper the author introduced the statisticηi j ijπ j m = m = Σ 1 as a measure of the ...
A numerical method to approximate first passage times distributions in direct Markov processes will...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...
AbstractA measure of the “mixing time” or “time to stationarity” in a finite irreducible discrete ti...
Markov chains have famously been a crucial tool in understanding stochastic processes and queuing sy...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...