Introduction to Probability · Problem 11.15

Random Walks — Grinstead & Snell

Mathematics — Probability · markov-chains-reversibility

Problem

Show that any ergodic Markov chain with a symmetric transition matrix (i.e., pij=pjip_{ij} = p_{ji}) is reversible.

Related theory

Browse the problem library