Let {X0, X1, X2,...} be a Markov chain on the state space S = {1, 2,...

   

Transcribed Image Text:

Let {X0, X1, X2,...} be a Markov chain on the state space S = {1, 2, 3, 4, 5, 6}, with the transition matrix 1140 0 0 0 34120 0 00 0 0 0 0 1 0 0 P 0 1 3 0 0 4 0 0 0 0 0 0 0 0 0 / 1 1 (a) Draw the transition diagram, and identify all communicating classes. For each class, state whether or not it is closed. Let {X0, X1, X2,...} be a Markov chain on the state space S = {1, 2, 3, 4, 5, 6}, with the transition matrix 1140 0 0 0 34120 0 00 0 0 0 0 1 0 0 P 0 1 3 0 0 4 0 0 0 0 0 0 0 0 0 / 1 1 (a) Draw the transition diagram, and identify all communicating classes. For each class, state whether or not it is closed.