Solution

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

A recurrent state satisfies , where . Saying that the transition matrix is recurrent means that every state is recurrent. In an irreducible Markov chain it suffices that one state is recurrent, since recurrence is a communicating-class property.

New to topics? Read the docs here!