(a) Let (Xt,t⩾0) be a continuous-time Markov chain on a countable state space I. Explain what is meant by a stopping time for the chain (Xt,t⩾0). State the strong Markov property. What does it mean to say that X is irreducible?
(b) Let (Xt,t⩾0) be a Markov chain on I={0,1,…} with Q-matrix given by Q=(qi,j)i,j∈I such that:
(1) qi,0>0 for all i⩾1, but q0,j=0 for all j∈I, and
(2) qi,i+1>0 for all i⩾1, but qi,j=0 if j>i+1.
Is (Xt,t⩾0) irreducible? Fix M⩾1, and assume that X0=i, where 1⩽i⩽M. Show that if J1=inf{t⩾0:Xt=X0} is the first jump time, then there exists δ>0 such that Pi(XJ1=0)⩾δ, uniformly over 1⩽i⩽M. Let T0=0 and define recursively for m⩾0,
Tm+1=inf{t⩾Tm:Xt=XTm and 1⩽Xt⩽M}
Let Am be the event Am={Tm<∞}. Show that Pi(Am)⩽(1−δ)m, for 1⩽i⩽M.
(c) Let (Xt,t⩾0) be the Markov chain from (b). Define two events E and F by
E={Xt=0 for all t large enough },F={t→∞limXt=+∞}
Show that Pi(E∪F)=1 for all i∈I.