Paper 1, Section II, K

Applied Probability | Part II, 2019

Let SS be a countable set, and let P=(pi,j:i,j∈S)P=\left(p_{i, j}: i, j \in S\right) be a Markov transition matrix with pi,i=0p_{i, i}=0 for all ii. Let Y=(Yn:n=0,1,2,…)Y=\left(Y_{n}: n=0,1,2, \ldots\right) be a discrete-time Markov chain on the state space SS with transition matrix PP.

The continuous-time process X=(Xt:t⩾0)X=\left(X_{t}: t \geqslant 0\right) is constructed as follows. Let (Um:m=0,1,2,…)\left(U_{m}: m=0,1,2, \ldots\right) be independent, identically distributed random variables having the exponential distribution with mean 1. Let gg be a function on SS such that ε<g(i)<1ε\varepsilon<g(i)<\frac{1}{\varepsilon} for all i∈Si \in S and some constant ε>0\varepsilon>0. Let Vm=Um/g(Ym)V_{m}=U_{m} / g\left(Y_{m}\right) for m⩾0m \geqslant 0. Let T0=0T_{0}=0 and Tn=∑m=0n−1VmT_{n}=\sum_{m=0}^{n-1} V_{m} for n⩾1n \geqslant 1. Finally, let Xt=YnX_{t}=Y_{n} for Tn⩽t<Tn+1T_{n} \leqslant t<T_{n+1}.

(a) Explain briefly why XX is a continuous-time Markov chain on SS, and write down its generator in terms of PP and the vector g=(g(i):i∈S)g=(g(i): i \in S).

(b) What does it mean to say that the chain XX is irreducible? What does it mean to say a state i∈Si \in S is (i) recurrent and (ii) positive recurrent?

(c) Show that

(i) XX is irreducible if and only if YY is irreducible;

(ii) XX is recurrent if and only if YY is recurrent.

(d) Suppose YY is irreducible and positive recurrent with invariant distribution π\pi. Express the invariant distribution of XX in terms of π\pi and gg.

Typos? Please submit corrections to this page on GitHub.