Where does the bell curve come from?
Watch it emerge live — from something as dumb as a ball bouncing off pegs.
Below is a Galton board: a triangle of pegs with bins along the bottom. Every ball you drop makes n tiny coin flips as it falls — left or right at each row. Its final bin equals the number of "rights" it took. Drop a hundred balls and watch what shape the pile settles into.
The Galton board · a bell curve building itself
🔵 blue = balls piling up in bins · red curve = the normal N(n/2, √(n/4)) the CLT predicts. The pile should hug the curve after a few hundred drops.
It works for anything, not just coins
The magic isn't the coin flip. Whenever you sum many small independent random things — whatever they individually look like — the total is approximately normal. Pick any source distribution below (even a skewed one) and average n draws together. Bell curve, every time.
Any source · bell curve out
🔵 blue = the raw source distribution · 🟠 orange = the sample-mean distribution · red = the normal the CLT predicts
The √n rule
The bell doesn't just appear — it also tightens. Doubling n only shrinks its width by √2. That's why quadrupling the sample size halves the standard error, not doubling.
Empirical std vs sample size · log-log
Slope on log-log should be −½ if the √n rule holds. Every step to the right = 4× the sample size = ½× the error.
Related models
- 📈 Power laws — the opposite tail shape. Thin tail vs heavy tail, bell curve vs straight log-log line, same data generators flip the result.
- 🚶 Random walks — walker positions become normal by the CLT. The √t rule in Ch 13 is CLT in disguise.
- 🎲 Entropy — the normal distribution is max-entropy given a mean and variance, so this one is literally the max-ignorance answer.