Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2004/ib/paper-1/11h/a/solution

An irreducible Markov chain has the property that for every pair of states there is an integer with . Equivalently every state can reach every other state along a finite path of positive-probability transitions.

New to topics? Read the docs here!