Back to AI Math Mind Map
中文·English
📐 AI MathID: detailed-balance

Markov Chain & Detailed Balance

马尔可夫链与细致平衡
🎯Core Definition
Detailed Balance is the key sufficient condition for a Markov chain to have stationary distribution π\pi: if the transition kernel P(ij)P(i \to j) satisfies the pairwise reversibility
📌Overview
π(i)P(ij)=π(j)P(ji),i,j,\pi(i) P(i \to j) = \pi(j) P(j \to i), \quad \forall\, i, j,
📌Overview
then π\pi is a stationary distribution of the chain. Proof: for any state jj,
📌Overview
iπ(i)P(ij)=iπ(j)P(ji)=π(j)iP(ji)=π(j),\sum_i \pi(i) P(i \to j) = \sum_i \pi(j) P(j \to i) = \pi(j) \sum_i P(j \to i) = \pi(j),
📌Overview
the first step substitutes detailed balance into each term of the sum, the last uses row-stochasticity iP(ji)=1\sum_i P(j \to i) = 1 — one step from π\pi stays at π\pi, i.e. πTP=πT\pi^T P = \pi^T, exactly the definition of stationarity.
💡Use Cases
the mathematical foundation of MCMC (especially Metropolis-Hastings) — designing a transition kernel reduces to verifying detailed balance pointwise, and stationarity follows automatically; interviews often ask "how does detailed balance imply a stationary distribution".
Key Problems Solved
it turns "find a stationary distribution" from solving the linear system πTP=πT\pi^T P = \pi^T (an eigenvalue problem) into checking a pairwise condition, which is far easier to construct; note that detailed balance is sufficient but not necessary — non-reversible chains can be stationary without it, yet MCMC almost always uses reversible designs (simpler and usually faster mixing).
🎯5 High-Frequency Exam Points
1
From detailed balance π(i)P(ij)=π(j)P(ji)\pi(i) P(i \to j) = \pi(j) P(j \to i), prove iπ(i)P(ij)=π(j)\sum_i \pi(i) P(i \to j) = \pi(j) — i.e. π\pi is stationary — justifying each step?
2
Is detailed balance sufficient or necessary for stationarity? Give an example of a stationary but non-reversible chain?
3
How does the vector form πTP=πT\pi^T P = \pi^T follow from detailed balance?
4
Why do MCMC constructions use detailed balance instead of solving πTP=πT\pi^T P = \pi^T directly?
5
Which regularity conditions (irreducibility, aperiodicity, positive recurrence) are additionally needed for convergence to stationarity?
Updated 2026-08-12
🎯
Test Your Knowledge: Practice Questions for "Markov Chain & Detailed Balance"
Single choice pitfall questions with instant feedback and mistake tracking.
🚀 Start Card Practice
Previous CardImportance SamplingNext CardMCMC & Detailed Balance

🔗 More AI Math Knowledge Cards

Adam/AdamW MathBayesian InferenceBias-Variance DecompositionBootstrap