Lab-in-a-Tab

Probability & The Bell Curve

Why does everything cluster in the middle? The universe has a favourite shape.

▶ Run the interactive simulation
StatisticsProbabilityNormal distribution

Why the middle always wins!

Junior level — plain language, no maths

Picture a board studded with rows of pegs in a triangle. Drop a ball in at the top, and at every peg it bounces left or right at random - a fair coin toss, every time. After tumbling all the way down, where does it end up?

Nearly always somewhere near the middle - and there's a lovely reason why. To finish at the far right, the ball would have to bounce right at every single peg in a row, like flipping ten heads in a row: possible, but rare. To finish near the middle it just needs roughly as many lefts as rights, and there are thousands of different left-right combinations that get it there. The middle wins not because anything is steering the ball, but simply because there are far more ways to reach it.

Drop enough balls and they pile into a smooth mound - tall in the centre, sloping away evenly on both sides. That's the bell curve, and once you've met it you'll start seeing it everywhere: people's heights, daily temperatures, exam marks, the tiny errors in any measurement. The recipe never changes. Whenever an outcome is the sum of many small, independent nudges, the middle is where they most often cancel out - and the middle is where you most often land.

Things worth knowing

  • Most adults are near 170 cm tall. Very few are above 2 m or below 1.4 m - the bell curve at work in human biology!
  • Flipping a coin 100 times almost always gives between 40 and 60 heads. Getting fewer than 30 or more than 70 would be extraordinary.
  • Daily temperature errors in weather forecasts follow a bell curve - forecasters use this to calculate confidence ranges.

The Binomial Distribution and the Normal Limit

Student level — the core equations

The peg machine has a name - the Galton board, built by Francis Galton in 1887. With \(n\) rows, a ball makes \(n\) independent left/right choices, each a fair coin flip, and the bin it ends in simply counts how many times it went right, \(k\). Those counts follow the binomial distribution \(P(k) = \binom{n}{k}(0.5)^n\).

That \(\binom{n}{k} = \dfrac{n!}{k!(n-k)!}\) is nothing more than a tally of how many distinct paths reach bin \(k\) - and it's the whole story. With 7 rows there are \(2^7 = 128\) equally likely paths in all; the centre bin is fed by \(\binom{7}{3} = 35\) of them, while each far edge has exactly one. More paths, more probability. Now crank \(n\) up and the jagged binomial smooths into the normal (Gaussian) distribution, with mean \(\mu = np\) and spread \(\sigma = \sqrt{np(1-p)}\). This isn't a happy accident; it's forced by the Central Limit Theorem.

Once a quantity is normal, the 68–95–99.7 rule tells you almost everything at a glance: roughly 68% of values fall within \(1\sigma\) of the mean, 95% within \(2\sigma\), and 99.7% within \(3\sigma\). It's why physicists insist on "5-sigma" before celebrating: a five-sigma bump has under a 1-in-3.5-million chance of being a random fluke, and that's the bar a genuine particle discovery has to clear.

Key formulas

Binomial probability\(P(k;n,p) = \binom{n}{k} p^k (1-p)^{n-k}\)
Mean\(\mu = np\)
Standard deviation\(\sigma = \sqrt{np(1-p)}\)
Gaussian density\(f(x) = \dfrac{1}{\sigma\sqrt{2\pi}}\,e^{-(x-\mu)^2/2\sigma^2}\)
68–95–99.7 rule\(P(|X-\mu| < \sigma) \approx 0.6827\)0.9545 at 2σ, 0.9973 at 3σ

Things worth knowing

  • Heights, blood pressure, IQ scores, and most biological measurements are approximately normally distributed, because they result from many independent genetic and environmental factors.
  • Casinos profit because the house edge, applied over millions of bets, converges to a reliable mean profit via the Law of Large Numbers.
  • Galton used the board to demonstrate "regression to the mean": tall parents tend to have children slightly shorter than themselves - extreme values regress toward average over generations.

The Central Limit Theorem, Berry–Esséen, and the universality of Gaussian statistics

Scholar level — full mathematical depth

01The theorem behind the bell curve's reach

The Central Limit Theorem is the reason a single curve haunts all of science. Take any independent, identically distributed variables \(X_1,\dots,X_n\) with mean \(\mu\) and finite variance \(\sigma^2\) - and it genuinely does not matter what they are, dice or incomes or photon counts - then standardise their average: \(Z_n = \dfrac{\bar{X}_n - \mu}{\sigma/\sqrt{n}}\). As \(n\to\infty\), \(Z_n\) converges in distribution to the standard normal \(N(0,1)\). The ingredients are forgotten; only the bell survives. That erasure of detail is the deepest thing about it.

02Why it's true: the Fourier fingerprint

The cleanest proof runs through characteristic functions - Fourier transforms of distributions, \(\varphi_X(t) = \mathbb{E}[e^{itX}]\) - which turn the awkward convolution of summing variables into ordinary multiplication. Take logarithms, Taylor-expand around the origin, and the first two terms are exactly the mean and the variance; everything higher is choked off by powers of \(1/\sqrt{n}\). What remains is \(\log\varphi_{Z_n}(t) \to -t^2/2\), and \(e^{-t^2/2}\) is the unmistakable signature of the Gaussian. The bell curve is simply whatever you get when only the first two moments survive.

03How fast: the Berry–Esséen bound

Convergence is one thing; convergence you can actually use is another. The Berry–Esséen theorem pins down the error. With \(\rho = \mathbb{E}[|X-\mu|^3]\) the third absolute moment, the worst-case gap between \(Z_n\)'s distribution and the true normal obeys \(\sup_x |F_n(x) - \Phi(x)| \le \dfrac{C\rho}{\sigma^3\sqrt{n}}\), with \(C \le 0.4748\). The \(1/\sqrt{n}\) rate is optimal - quadruple the sample to halve the error - and skewed distributions, carrying a large \(\rho\), crawl toward the bell more slowly than symmetric ones.

04When the bell breaks: heavy tails

There's a price of admission: finite variance. Break that condition and the Gaussian loses its grip entirely. The Cauchy distribution - the ratio of two normals - has tails so fat that its variance, and even its mean, simply don't exist; average a million Cauchy draws and you are no better off than with one. Such sums converge instead to Lévy stable distributions, a broader family with tails \(P(X>x)\sim x^{-\alpha}\) for \(0<\alpha\le 2\), of which the Gaussian (\(\alpha=2\)) is just the tame special case. Markets, earthquakes and avalanches live out here - which is why "hundred-year events" keep showing up early.

05Beyond independence

Real data are rarely so well-mannered, and the theorem stretches to meet them. There are versions for weakly dependent variables, for triangular arrays under the Lindeberg condition, and for sums where no single term is allowed to dominate. Correlated Gaussian dynamics get their own workhorses: the Ornstein–Uhlenbeck process and its discrete cousin the AR(1) model describe mean-reverting noise, surfacing everywhere from interest rates to neural membrane voltages to climate wobble.

06Why nature keeps reaching for the Gaussian

Stitched together, the CLT explains why the bell is the universe's default setting. Anything you can measure that is built from a crowd of small, roughly independent contributions - a height from thousands of genes and meals, thermal noise from countless jostling electrons, an error from many tiny imperfections - drifts toward the same shape. It also quietly underwrites classical statistics: t-tests, confidence intervals and error bars all lean on normality for large samples. The bell curve isn't nature's favourite shape by taste. It's the shape that's left over once the details are allowed to cancel.

Key formulas

Central Limit Theorem\(Z_n = \dfrac{\bar{X}_n - \mu}{\sigma/\sqrt{n}} \;\xrightarrow{d}\; N(0,1)\)
Characteristic function\(\varphi_X(t) = \mathbb{E}\!\left[e^{itX}\right]\)
Gaussian limit\(\log\varphi_{Z_n}(t) \to -\dfrac{t^2}{2}\)
Berry–Esséen\(\sup_x |F_n(x) - \Phi(x)| \le \dfrac{C\rho}{\sigma^3\sqrt{n}}\)C ≤ 0.4748
Lévy stable tail\(P(X > x) \sim x^{-\alpha},\quad 0 < \alpha \le 2\)

Things worth knowing

  • Student's t-distribution is correct for small samples (n < 30) and converges to the Normal as n → ∞ - a direct consequence of the CLT.
  • Black-Scholes option pricing assumes normally distributed log-returns - a CLT approximation that breaks down during market crashes (fat tails).
  • The Cauchy distribution (ratio of two normals) has undefined mean and infinite variance - its CLT fails, and the sample mean does NOT converge.

Sources

Full article on Wikipedia ↗