# Question: For a Markov chain with each of the transition probability

For a Markov chain with each of the transition probability matrices in (a)–( c), find the communicating classes and the periodicity of the various states.

(a)

(b)

(c)

(a)

(b)

(c)

## Answer to relevant Questions

Prove that if i↔ j then d (i) = d (j), and hence all states in the same class must have the same period. Suppose a Bernoulli trial results in a success with probability p and a failure with probability 1 – p. Suppose the Bernoulli trial is repeated indefinitely with each repitition independent of all others. Let Xn be a “ ...A Web Search Engine Model - Suppose after we enter some keywords into our web search engine it finds five pages that contain those keywords. We will call these pages A, B, C, D, and E. The engine would like to rank the pages ...Let SXX (f) be the PSD function of a WSS discrete- time process X (n). Recall that one way to obtain this PSD function is to compute RXX [n] = E [X[k] X [k+ n]] and then take the DFT of the resulting autocorrelation ...Consider an AR (2) process which is described by the recursion Y [n] = a1Y [n– 1] + a2Y [n– 2] + X [n] Where is an IID random process with zero- mean and variance σ2X. (a) Show that the autocorrelation function of the ...Post your question