On ageing properties of first-passage times of increasing Markov processes

2002 ◽  
Vol 34 (1) ◽  
pp. 241-259 ◽  
Author(s):  
Félix Belzunce ◽  
Eva-María Ortega ◽  
José M. Ruiz
Keyword(s):  
Markov Chain ◽  
Markov Processes ◽  
Continuous Time ◽  
Transition Matrix ◽  
Sufficient Conditions ◽  
First Passage Times ◽  
Generator Matrix ◽  
First Passage ◽  
Finite Case ◽  
Passage Times

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.

On ageing properties of first-passage times of increasing Markov processes

2002 ◽  
Vol 34 (01) ◽  
pp. 241-259
Author(s):  
Félix Belzunce ◽  
Eva-María Ortega ◽  
José M. Ruiz
Keyword(s):  
Markov Chain ◽  
Markov Processes ◽  
Continuous Time ◽  
Transition Matrix ◽  
Sufficient Conditions ◽  
First Passage Times ◽  
Generator Matrix ◽  
First Passage ◽  
Finite Case ◽  
Passage Times

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.

On first-passage times in increasing Markov processes

1996 ◽  
Vol 26 (3) ◽  
pp. 199-203 ◽  
Author(s):  
Rafael Pérez-Ocón ◽  
M.Luz Gámiz-Pérez
Keyword(s):  
Markov Processes ◽  
First Passage Times ◽  
First Passage ◽  
Passage Times

scholarly journals SIMPLE PROCEDURES FOR FINDING MEAN FIRST PASSAGE TIMES IN MARKOV CHAINS

2007 ◽  
Vol 24 (06) ◽  
pp. 813-829 ◽  
Author(s):  
JEFFREY J. HUNTER
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Stationary Distribution ◽  
Linear Equations ◽  
First Passage Times ◽  
First Passage ◽  
Mean First Passage Times ◽  
The Mean ◽  
Computational Procedures ◽  
Passage Times

The derivation of mean first passage times in Markov chains involves the solution of a family of linear equations. By exploring the solution of a related set of equations, using suitable generalized inverses of the Markovian kernel I - P, where P is the transition matrix of a finite irreducible Markov chain, we are able to derive elegant new results for finding the mean first passage times. As a by-product we derive the stationary distribution of the Markov chain without the necessity of any further computational procedures. Standard techniques in the literature, using for example Kemeny and Snell's fundamental matrix Z, require the initial derivation of the stationary distribution followed by the computation of Z, the inverse of I - P + eπT where eT = (1, 1, …, 1) and πT is the stationary probability vector. The procedures of this paper involve only the derivation of the inverse of a matrix of simple structure, based upon known characteristics of the Markov chain together with simple elementary vectors. No prior computations are required. Various possible families of matrices are explored leading to different related procedures.

Ageing first-passage times of Markov processes: a matrix approach

1997 ◽  
Vol 34 (1) ◽  
pp. 1-13 ◽  
Author(s):  
Haijun Li ◽  
Moshe Shaked
Keyword(s):  
Markov Process ◽  
Markov Processes ◽  
First Passage Time ◽  
Passage Time ◽  
Critical Value ◽  
First Passage Times ◽  
Matrix Approach ◽  
First Passage ◽  
Passage Times

Using a matrix approach we discuss the first-passage time of a Markov process to exceed a given threshold or for the maximal increment of this process to pass a certain critical value. Conditions under which this first-passage time possesses various ageing properties are studied. Some results previously obtained by Li and Shaked (1995) are extended.

Processes with new better than used first-passage times

1984 ◽  
Vol 16 (03) ◽  
pp. 667-686 ◽  
Author(s):  
J. G. Shanthikumar
Keyword(s):  
Point Process ◽  
Markov Processes ◽  
Probability Space ◽  
Sufficient Conditions ◽  
General Point ◽  
First Passage ◽  
Semi Markov Processes ◽  
New Better Than Used ◽  
Better Than ◽  
Passage Times

Let with Z(0) = 0 be a random process under investigation and N be a point process associated with Z. Both Z and N are defined on the same probability space. Let with R 0 = 0 denote the consecutive positions of points of N on the half-line . In this paper we present sufficient conditions under which (Z, R) is a new better than used (NBU) process and give several examples of NBU processes satisfying these conditions. In particular we consider the processes in which N is a renewal and a general point process. The NBU property of some semi-Markov processes is also presented.

Sign in / Sign up

Export Citation Format

Share Document