Consider a stochastically monotone chain with monotone paths on a partially ordered countable set S. Let C be an increasing subset of S with finite complement. Then the first passage-time from i ∈ S to C is shown to be IFRA (increasing failure rate on the,av;rage). Several applications are presented including coherent systems, shock models, and convolutions of IFRA distributions
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
For a class of Gauss-Markov processes the asymptotic behavior of the first passage time (FPT) probab...
This book provides an undergraduate-level introduction to discrete and continuous-time Markov chains...
Consider a stochastically monotone chain with monotone paths on a partially ordered countable set S....
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...
AbstractWe derive simple criteria to ensure the finiteness of the mean first-passage times into semi...
AbstractA stochastic matrix is “monotone” [4] if its row-vectors are stochastically increasing. Clos...
Suppose $X$ is a Markov process on the real line (or some interval). Do the distributions of its fir...
AbstractLet X be an ergodic Markov chain on a finite state space S0 and let s and t be finite sequen...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
We investigate the probability of the first hitting time of some discrete Markov chain that converge...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...
International audienceMarkov chains are a fundamental class of stochastic processes. They are widely...
We review recent theoretical works that enable the accurate evaluation of the mean first passage tim...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
For a class of Gauss-Markov processes the asymptotic behavior of the first passage time (FPT) probab...
This book provides an undergraduate-level introduction to discrete and continuous-time Markov chains...
Consider a stochastically monotone chain with monotone paths on a partially ordered countable set S....
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...
AbstractWe derive simple criteria to ensure the finiteness of the mean first-passage times into semi...
AbstractA stochastic matrix is “monotone” [4] if its row-vectors are stochastically increasing. Clos...
Suppose $X$ is a Markov process on the real line (or some interval). Do the distributions of its fir...
AbstractLet X be an ergodic Markov chain on a finite state space S0 and let s and t be finite sequen...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
We investigate the probability of the first hitting time of some discrete Markov chain that converge...
Many Markov chains with a single absorbing state have a unique limiting conditional distribution (LC...
International audienceMarkov chains are a fundamental class of stochastic processes. They are widely...
We review recent theoretical works that enable the accurate evaluation of the mean first passage tim...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
For a class of Gauss-Markov processes the asymptotic behavior of the first passage time (FPT) probab...
This book provides an undergraduate-level introduction to discrete and continuous-time Markov chains...