Solution

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

A chain is reversible with respect to when for all states. For random walk on a finite connected undirected graph, satisfies this because both sides equal on an edge and zero otherwise.

New to topics? Read the docs here!