Markov renewal process

Generalization of Markov jump processes

Markov renewal processes are a class of random processes in probability and statistics that generalize the class of Markov jump processes. Other classes of random processes, such as Markov chains and Poisson processes, can be derived as special cases among the class of Markov renewal processes, while Markov renewal processes are special cases among the more general class of renewal processes.

## Definition

[edit]

An illustration of a Markov renewal process

In the context of a jump process that takes states in a state space  S {\displaystyle \mathrm {S} } , consider the set of random variables  ( X n , T n ) {\displaystyle (X_{n},T_{n})} , where  T n {\displaystyle T_{n}} represents the jump times and  X n {\displaystyle X_{n}} represents the associated states in the sequence of states (see Figure). Let the sequence of inter-arrival times  τ n = T n − T n − 1 {\displaystyle \tau _{n}=T_{n}-T_{n-1}} . In order for the sequence  ( X n , T n ) {\displaystyle (X_{n},T_{n})} to be considered a Markov renewal process the following condition should hold:

Pr ( τ n + 1 ≤ t , X n + 1 = j ∣ ( X 0 , T 0 ) , ( X 1 , T 1 ) , … , ( X n = i , T n ) ) = Pr ( τ n + 1 ≤ t , X n + 1 = j ∣ X n = i ) ∀ n ≥ 1 , t ≥ 0 , i , j ∈ S {\displaystyle {\begin{aligned}&\Pr(\tau _{n+1}\leq t,X_{n+1}=j\mid (X_{0},T_{0}),(X_{1},T_{1}),\ldots ,(X_{n}=i,T_{n}))\\\\[5pt]={}&\Pr(\tau _{n+1}\leq t,X_{n+1}=j\mid X_{n}=i)\,\forall n\geq 1,t\geq 0,i,j\in \mathrm {S} \end{aligned}}}

## Relation to other stochastic processes

[edit]

1. Let  X n {\displaystyle X_{n}} and  T n {\displaystyle T_{n}} be as defined in the previous statement. Defining a new stochastic process  Y t := X n {\displaystyle Y_{t}:=X_{n}} for  t ∈ [ T n , T n + 1 ) {\displaystyle t\in [T_{n},T_{n+1})} , then the process  Y t {\displaystyle Y_{t}} is called a semi-Markov process as it happens in a continuous-time Markov chain. The process is Markovian only at the specified jump instants, justifying the name semi-Markov.[1][2][3] (See also: hidden semi-Markov model.)
2. A semi-Markov process (defined in the above bullet point) in which all the holding times are exponentially distributed is called a continuous-time Markov chain. In other words, if the inter-arrival times are exponentially distributed and if the waiting time in a state and the next state reached are independent, we have a continuous-time Markov chain.

Pr ( τ n + 1 ≤ t , X n + 1 = j ∣ ( X 0 , T 0 ) , ( X 1 , T 1 ) , … , ( X n = i , T n ) ) = Pr ( τ n + 1 ≤ t , X n + 1 = j ∣ X n = i ) = Pr ( X n + 1 = j ∣ X n = i ) ( 1 − e − λ i t ) , for all n ≥ 1 , t ≥ 0 , i , j ∈ S , i ≠ j {\displaystyle {\begin{aligned}&\Pr(\tau _{n+1}\leq t,X_{n+1}=j\mid (X_{0},T_{0}),(X_{1},T_{1}),\ldots ,(X_{n}=i,T_{n}))\\\\[3pt]={}&\Pr(\tau _{n+1}\leq t,X_{n+1}=j\mid X_{n}=i)\\\\[3pt]={}&\Pr(X_{n+1}=j\mid X_{n}=i)(1-e^{-\lambda _{i}t}),{\text{ for all }}n\geq 1,t\geq 0,i,j\in \mathrm {S} ,i\neq j\end{aligned}}}
3. The sequence  X n {\displaystyle X_{n}} in the Markov renewal process is a discrete-time Markov chain. In other words, if the time variables are ignored in the Markov renewal process equation, we end up with a discrete-time Markov chain.

Pr ( X n + 1 = j ∣ X 0 , X 1 , … , X n = i ) = Pr ( X n + 1 = j ∣ X n = i ) ∀ n ≥ 1 , i , j ∈ S {\displaystyle \Pr(X_{n+1}=j\mid X_{0},X_{1},\ldots ,X_{n}=i)=\Pr(X_{n+1}=j\mid X_{n}=i)\,\forall n\geq 1,i,j\in \mathrm {S} }
4. If the sequence of  τ {\displaystyle \tau } s is independent and identically distributed, and if their distribution does not depend on the state  X n {\displaystyle X_{n}} , then the process is a renewal. So, if the states are ignored and we have a chain of iid times, then we have a renewal process.

Pr ( τ n + 1 ≤ t ∣ T 0 , T 1 , … , T n ) = Pr ( τ n + 1 ≤ t ) ∀ n ≥ 1 , ∀ t ≥ 0 {\displaystyle \Pr(\tau _{n+1}\leq t\mid T_{0},T_{1},\ldots ,T_{n})=\Pr(\tau _{n+1}\leq t)\,\forall n\geq 1,\forall t\geq 0}

## See also

[edit]

* Markov process
* Renewal theory
* Variable-order Markov model
* Hidden semi-Markov model

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (July 2012) (Learn how and when to remove this message)

|

## References

[edit]

1. ^ Medhi, J. (1982). Stochastic processes. New York: Wiley & Sons. ISBN 978-0-470-27000-4.
2. ^ Ross, Sheldon M. (1999). Stochastic processes (2nd ed.). New York [u.a.]: Routledge. ISBN 978-0-471-12062-9.
3. ^ Barbu, Vlad Stefan; Limnios, Nikolaos (2008). Semi-Markov chains and hidden semi-Markov models toward applications: their use in reliability and DNA analysis. New York: Springer. ISBN 978-0-387-73171-1.