Consider a Markov chain on S = {0, 1, 2, ......}. The transition probabilities are given by :
\(p_{00} = \dfrac{1}{2}\) \(p_{01} = \dfrac{1}{2}\)
and for \(i \ge 1\),
\(p_{ii - 1} = \dfrac{1}{2}\) \(p_{ii + 1} = \dfrac{1}{2}\)
Then :
MH SET - 2019, SET Exam - 2019,
Answer: D
All states are transient or persistent null (in fact null persistent).
This is a symmetric random walk on \(\{0, 1, 2, \ldots\}\), with the step down from 0 replaced by staying put. It behaves like the distance from the origin of a simple symmetric walk, which returns with probability 1, so every state is persistent.
A stationary distribution would satisfy \(\pi_{0} = \tfrac{1}{2}\pi_{0} + \tfrac{1}{2}\pi_{1}\) and \(\pi_{j} = \tfrac{1}{2}\pi_{j-1} + \tfrac{1}{2}\pi_{j+1}\), giving \(\pi_{j} = \pi_{0}\) for all \(j\), which cannot sum to 1. So there is no stationary distribution, and the persistent states are null.
Hence no state is non-null persistent, and no stationary distribution exists, ruling out A, B and C.
Please log in or register to report this question.