Question: Let X be a Markov chain with M states. - Prove that if state j can be reached from state i , then it can
Let X be a Markov chain with M states.
- Prove that if state j can be reached from state i, then it can be reached in M steps or less.
-Let P be the transition probability matrix of the Markov chain X. Argue that if for some positive integer r, Pr has all positive entries, then so does Pn, for all integers nr .
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
