Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2007/ib/paper-4/9c/i/solution

For a time-homogeneous Markov chain with transition matrix , two states are communicating states when each can be reached from the other with positive probability in finitely many steps:
The convention includes communication of a state with itself.

New to topics? Read the docs here!