Define what is meant by a communicating class and a closed class in a Markov chain.
A Markov chain (Xn:n⩾0) with state space {1,2,3,4} has transition matrix
P=⎝⎜⎜⎜⎛210212102100210210021021⎠⎟⎟⎟⎞
Write down the communicating classes for this Markov chain and state whether or not each class is closed.
If X0=2, let N be the smallest n such that Xn=2. Find P(N=n) for n=1,2,… and E(N). Describe the evolution of the chain if X0=2.