Quant Memo
Advanced

Modes of Convergence: In Probability and In Distribution

Two different, precise meanings of 'settles down as the sample grows' — one says your estimate gets close to the true number, the other only says its whole distribution starts to look like some fixed shape.

Prerequisites: The Law of Large Numbers, The Central Limit Theorem

Statisticians say an estimator "converges" as the sample size grows, but that word hides two genuinely different promises. One says your estimate homes in on a single, specific number. The other says your estimate's shape of uncertainty settles into a recognizable pattern, even though the estimate itself is still random and never stops moving. Confusing the two leads to real mistakes — like thinking a large sample average is a fixed number when it's really a bell curve you've only shrunk, not eliminated.

An analogy: a marksman and a moving target

Convergence in probability is a marksman whose shots cluster tighter and tighter around the bullseye as they get more practice — with enough practice, the chance of landing more than a millimeter from the center goes to zero. The bullseye is a fixed point, and the shots collapse onto it.

Convergence in distribution is different: it's not about hitting a fixed point at all, but about the pattern of where shots land settling into a recognizable, unchanging shape — say, a tight cluster in the shape of a specific oval — even though every individual shot is still random and the cluster never shrinks to a single point. The oval itself stops changing shape; the shots inside it never stop moving.

In probability, one symbol at a time

An estimator θ^n\hat\theta_n (read "theta-hat, based on nn observations") converges in probability to the true value θ\theta if, for every tiny tolerance ϵ\epsilon you name,

P(θ^nθ>ϵ)0as nP\big(|\hat\theta_n - \theta| > \epsilon\big) \to 0 \quad \text{as } n \to \infty

In plain English: name any margin of error, however small, and the chance your estimate misses the truth by more than that margin shrinks to zero as your sample grows. This is written θ^npθ\hat\theta_n \xrightarrow{p} \theta, and it is exactly the guarantee behind the Law of Large Numbers: a sample mean converges in probability to the true population mean.

In distribution, one symbol at a time

A sequence of random variables ZnZ_n converges in distribution to a random variable ZZ if the probability that ZnZ_n falls below any value zz gets arbitrarily close to the probability that ZZ falls below that same zz:

P(Znz)P(Zz)for every zP(Z_n \le z) \to P(Z \le z) \quad \text{for every } z

In plain English: the whole shape of ZnZ_n's distribution — not ZnZ_n itself — comes to resemble the shape of ZZ's distribution. ZnZ_n is still random and still bouncing around; only its histogram settles down. This is written ZndZZ_n \xrightarrow{d} Z, and it is the guarantee behind the Central Limit Theorem: the standardized, rescaled sample mean converges in distribution to a standard normal — even though the raw sample mean itself is converging in probability to a single point, not a spread-out normal curve.

Sampling distribution
sample mean →
sample size n 10spread of means 0.332predicted 1/√n 0.316

The explorer above shows both ideas at once. Watch the sample mean tighten toward the true parent mean as nn grows — that's convergence in probability, collapsing onto a point. Now imagine instead plotting n\sqrt{n} times the mean's deviation from the truth — that quantity does not collapse; its histogram settles into a fixed bell shape. Same underlying process, two different questions about it.

Convergence explorer
true meansamples →
after n = 200estimate -0.025error 0.025std error 0.071

The running-average explorer above is convergence in probability in its purest form: the line homes in on one fixed number and the band around it visibly narrows as nn grows — there is no analogous picture for convergence in distribution, because what "narrows" there is not the spread of ZnZ_n but the gap between its histogram and a fixed target shape.

Convergence in probability collapses onto a single number; convergence in distribution settles onto a fixed shape that the random variable keeps bouncing around inside. Convergence in probability is the stronger, more specific statement — and it implies convergence in distribution (to a constant), but not the reverse.

Worked example 1: watching a sample mean converge in probability

Roll a fair six-sided die repeatedly; the true mean is μ=3.5\mu = 3.5. Simulate averages over growing sample sizes: after n=10n=10 rolls, a plausible sample mean is 3.93.9, missing the truth by 0.40.4. After n=100n=100 rolls, a plausible mean is 3.583.58, missing by 0.080.08. After n=10,000n=10{,}000 rolls, a plausible mean is 3.5033.503, missing by 0.0030.003.

Fix a tolerance, say ϵ=0.1\epsilon = 0.1. At n=10n=10, missing by more than 0.10.1 is quite likely — the sample mean regularly lands more than 0.1 away from 3.5. By n=10,000n=10{,}000, the chance of missing by more than 0.10.1 has become vanishingly small, even though individual outcomes are still random. That shrinking probability of a "large miss," for any tolerance you name, is convergence in probability, made concrete.

Worked example 2: the CLT's rescaled quantity that never collapses

Take the same die, but now track Zn=n(Xˉn3.5)Z_n = \sqrt{n}\,(\bar{X}_n - 3.5) — the deviation from the truth, blown back up by n\sqrt{n} to compensate for the shrinking. The true variance of one die roll is σ2=2.917\sigma^2 = 2.917, so the CLT predicts ZndN(0,2.917)Z_n \xrightarrow{d} N(0, 2.917).

At n=100n=100: Xˉ100=3.58\bar X_{100} = 3.58 gives Z100=100×0.08=0.8Z_{100} = \sqrt{100}\times 0.08 = 0.8. At n=10,000n=10{,}000: Xˉ10000=3.503\bar X_{10000}=3.503 gives Z10000=10000×0.003=0.3Z_{10000} = \sqrt{10000}\times 0.003 = 0.3. These two values of ZnZ_n look similarly small and unremarkable — because unlike Xˉn\bar X_n itself, ZnZ_n's spread is not shrinking with nn; both are draws from roughly the same bell curve of width 2.9171.71\sqrt{2.917}\approx 1.71. Run this simulation many times at each nn and histogram the resulting ZnZ_n values: at n=100n=100 the histogram is already close to a N(0,2.917)N(0, 2.917) bell curve, and at n=10,000n=10{,}000 it looks essentially identical — the shape stopped changing, even though no individual ZnZ_n value ever stops being random.

What this means in practice

  • Consistency of an estimator — the property that it converges to the truth as data grows — is exactly convergence in probability, and it's the minimum bar any usable estimator must clear.
  • Confidence intervals and hypothesis tests rely on convergence in distribution, not convergence in probability — the whole reason a tt-statistic has a known, usable distribution in large samples is that it converges in distribution to a normal, even though the statistic itself never stops being random.
  • "Large sample" claims in a paper or model should specify which kind of convergence is being invoked — a claim that a parameter estimate is "accurate in large samples" needs convergence in probability; a claim that "the test statistic is approximately normal in large samples" needs convergence in distribution. They are not interchangeable justifications.

The classic mix-up is treating a quantity that converges in distribution as if it were "settling down to a number," the way something converging in probability does. A test statistic converging in distribution to N(0,1)N(0,1) never gets close to any single value as nn grows — it stays exactly as spread out as a standard normal, forever. What stabilizes is the shape of its randomness, not the randomness itself. Forgetting this leads people to wrongly expect a tt-statistic or zz-statistic to get "more precise" with a bigger sample, when its distribution was designed to stay put.

Related concepts

Practice in interviews

Further reading

  • Casella & Berger, Statistical Inference, sec. 5.5
  • van der Vaart, Asymptotic Statistics, ch. 2
ShareTwitterLinkedIn