Question: 9. Prove that if the number of states in a Markov chain is M, and if state j can be reached from state /, then

9. Prove that if the number of states in a Markov chain is M, and if state j can be reached from state /, then it can be reached in M steps or less.

*10. Show that if state / is recurrent and state i does not communicate with statey, then Pu = 0. This implies that once a process enters a recurrent class of states it can never leave that class. For this reason, a recurrent class is often referred to as a closed class.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Theory Of Probability Questions!