Quant Memo
Advanced

Coupling and Total Variation Distance

A precise way to measure "how different are two distributions" by building the best possible joint experiment that makes two random variables agree as often as probability allows.

Prerequisites: Markov Chains, The Law of Large Numbers

How different are two probability distributions? "Different means" is one answer, but crude — two distributions can share a mean and still barely overlap. Total variation distance answers a sharper question: what's the largest possible gap between the probabilities the two distributions assign to any event? Coupling is the constructive trick for computing it: instead of comparing distributions in the abstract, build two random variables on the same coin flips that agree as often as is mathematically possible.

The analogy: two biased dice, matched as often as possible

Imagine two dice with slightly different weightings — die A favors 6s a bit, die B is fair. You want to roll them "together" so that, as often as possible, they land on the same face — using a single shared source of randomness to drive both rolls at once. The best such construction succeeds in matching them with probability exactly 1dTV(A,B)1 - d_{TV}(A,B), the total variation distance. Any joint construction — any "coupling" — can do no better; that ceiling is precisely what total variation distance measures.

Writing it down

For distributions PP and QQ on the same space, total variation distance is

dTV(P,Q)=supAP(A)Q(A),d_{TV}(P,Q) = \sup_{A} \big| P(A) - Q(A) \big|,

the biggest possible disagreement between PP and QQ on the probability of any single event AA. In words: find the event both distributions disagree about the most — that disagreement, at its worst, is the distance. Equivalently, for discrete distributions with probability mass functions p(x),q(x)p(x), q(x),

dTV(P,Q)=12xp(x)q(x).d_{TV}(P,Q) = \tfrac{1}{2}\sum_x |p(x) - q(x)|.

In words: sum up the absolute gap between the two distributions at every outcome, and halve it. A coupling is a joint distribution (X,Y)(X,Y) with XPX\sim P and YQY \sim Q marginally. The coupling inequality says P(XY)dTV(P,Q)P(X \ne Y) \ge d_{TV}(P,Q) for every coupling, with equality achieved by the best one — called the maximal coupling. In words: no matter how cleverly you try to link two random draws from PP and QQ, they'll disagree at least dTV(P,Q)d_{TV}(P,Q) of the time — and there's always a way to hit that floor exactly.

Distribution · normal
-2.000.002.00μvalue →
Within ±1σ 68.3%mean μ 0.00std σ 1.00

Compare two normal curves with different means side by side mentally: the region where one curve sits clearly above the other is the "disagreement" total variation distance is built from — shift the mean and watch that overlap shrink.

Worked example 1: two coins

Coin A: P(heads)=0.6P(\text{heads}) = 0.6. Coin B: P(heads)=0.5P(\text{heads})=0.5. Total variation distance: dTV=12(0.60.5+0.40.5)=12(0.1+0.1)=0.1d_{TV} = \tfrac12(|0.6-0.5| + |0.4-0.5|) = \tfrac12(0.1+0.1) = 0.1. So the best possible coupling makes them land the same 90% of the time — construct it explicitly: draw UUniform(0,1)U \sim \text{Uniform}(0,1); set A's result to heads if U<0.6U < 0.6, B's result to heads if U<0.5U<0.5. They agree whenever U<0.5U<0.5 (both heads) or U0.6U\ge0.6 (both tails) — that's 0.5+0.4=0.90.5 + 0.4 = 0.9 of the time, matching 10.11-0.1 exactly.

Worked example 2: Markov chain mixing

A Markov chain modeling a market regime (say, "calm" vs. "stressed" states, each day) has a stationary distribution π\pi. Starting from "calm" with certainty, after tt days the chain's distribution PtP_t has moved partway to π\pi. Suppose dTV(Pt,π)=0.5td_{TV}(P_t, \pi) = 0.5^t (a typical geometric mixing rate for a simple two-state chain with self-transition probability 0.75). After t=1t=1: distance 0.50.5 — still very far from stationary, the "calm" start dominates. After t=5t=5: distance 0.0310.031 — under 97% coupled with the long-run distribution; for most practical purposes ("has the regime forgotten where it started?") the chain has mixed. This is literally how "mixing time" is defined: the smallest tt such that dTV(Pt,π)d_{TV}(P_t,\pi) drops below a small threshold like 0.25.

Path explorer
0-0time →
end (bold path) 0.02spread of ends 0.196 independent paths, same settings

Sample a few paths here and watch how quickly they forget their shared starting point and spread across the range typical of the process — that forgetting is mixing in action, and total variation distance is exactly what measures how much "started here" information is left at any given time.

What this means in practice

  • Markov chain Monte Carlo. Total variation distance to the target distribution, tracked via coupling arguments, is the standard way to certify that an MCMC sampler has "burned in" and its samples can be trusted.
  • Regime-switching models. How fast a hidden-state model forgets its initial state (calm vs. crisis) is a mixing-time question answered with exactly this machinery.
  • Model comparison. Two calibrated models that produce nearly identical means and variances can still have large total variation distance — meaning they disagree sharply on tail events, which is often exactly what matters for risk.

Total variation distance is the largest possible probability gap between two distributions on any single event, and a coupling — a joint construction of two random variables sharing the same randomness — achieves agreement exactly 1dTV1-d_{TV} of the time, no better and no worse than the best coupling can.

It's tempting to think a small total variation distance means the distributions are "close" in every practical sense — but dTVd_{TV} treats all disagreements equally regardless of magnitude. Two distributions can have tiny total variation distance while disagreeing enormously on rare, extreme outcomes if that disagreement is confined to a low-probability region; TV distance says nothing about how far apart the outcomes are when they do disagree, only how often. For that, see The Wasserstein Distance.

Related concepts

Practice in interviews

Further reading

  • Levin, Peres, Markov Chains and Mixing Times (ch. 4)
  • Lindvall, Lectures on the Coupling Method
ShareTwitterLinkedIn