1 1/4 0 0 0 0 0 0 0 0 1/2 0 1/4 1/6 1/6 1/6 1/2 0 1/2 1/2 0 000 1 (a) Calculate P(X10 = 2 | X8 = 4). (b) Calculate the probability that the chain is absorbed in state 5. 'T-1 (c) Calculate Ext where T is the time of absorption. t=0 (d) Explain why this chain has infinitely many equilibrium distributions.

Find the limiting distribution for this Markov chain.

The sequence (Xn)n>o is a Markov chain with transition matrix 0 을 0 0 0 3 1 0 0 0 4 4 0 } 0 0 0 1 2 1 1 0 0 3 3 0 } 0 } 0 0 0 0 0 0 0 (a) Draw the transition diagram for (Xn). (b) Determine the communicating classes of the chain, stating whether each class is recurrent or transient. (c) Determine the period of each communicating class.

2. Let Xo, X₁,... be the Markov chain on state space {1,2,3,4} with transition matrix (1/2 1/2 0 0 1/7 0 3/7 3/7 1/3 1/3 1/3 0 0 2/3 1/6 1/6/ (a) Explain how you can tell this Markov chain has a limiting distribution and how you could compute it.

Recall that the graph of a discrete-time, finite-state, homogeneous Markov chain on two states 1, 2 with transition matrix is CO (: :) 1 T = If instead a new Markov chain on three states {1, 2, 3} has transition matrix 10 1 0 (a) Draw the corresponding graph for this new Markov chain. (b) Is the Markov chain with transition matrix T irreducible?

Define Markov matrix.

Suppose the transition matrix for a Markov Chain is T = stable population, i.e. an x0₂ such that Tx = x. ساله داد Find a non-zero