Concept

Binomial distribution

The distribution of how many successes come out of a fixed number of independent trials with the same chance each. Its mean is the number of trials times the chance of success, and its spread grows like the square root of that number.

Named by 9 essays across 4 fields — each of them below, with the objects they name alongside it.

A Galton board after 600 balls. 600 balls fall through 12 rows of pegs, each bouncing left or right at random, and pile up in a bell-shaped heap.

A bell curve assembled out of coin flips

Drop six hundred balls through a board of pegs, each bouncing left or right at random, and they pile up in a shape that can be predicted precisely. Nothing coordinated them.

probability · Central limit
Nine walks, and the square root. 9 independent walks of 400 steps, each step one place left or right. The dashed curves are ±√n: the walks stay near them, spill past them, and come back — which is what a typical distance means as opposed to a limit.

A walk that always comes home, until it does not

Step left or right at random, forever, and the walk returns to where it started with certainty. On a grid it also returns. In space it does not, and about a third of walks leave and never come back.

probability · Random walk
A polygon of 4 points averaged down to its curve at t = 0.40. A control polygon of 4 points, the 3 rounds of weighted averaging at t = 0.40 drawn as nested polylines, the single point they end at, and the whole curve those points trace. The weights on the control points are 0.216, 0.432, 0.288, 0.064.

Averaging down the triangle

Change one word in the rule that builds Pascal's triangle — take a share of each entry above instead of adding them — and the triangle stops counting and starts averaging. The same rule then draws smooth curves from polygons and approximates every continuous function by polynomials, at a rate that no amount of smoothness can improve.

discrete · Pascals triangle
Channel capacity 1 − H(p), and three codes at p = 0.1. The capacity of the binary symmetric channel plotted against its flip probability, with the rates of repetition, the Hamming code and no coding marked at one flip probability.

The rate a noisy channel allows

A channel that flips one bit in ten can still carry messages with as few errors as anyone likes — at up to 0.531 message bits per transmitted bit, and at no rate above that. The number is Shannon's capacity, 1 − H(p). Repetition reaches reliability only by sending nothing; a code chosen at random gets there at any rate below the limit; and the reason there is a limit at all is a count of how many flip patterns a block of noise can hold.

computation · Error-correcting codes
A majority of independent voters, more often right than any of them. The probability that a simple majority of n independent voters is right, for n from 1 to 201, when each voter is right with probability 0.45, 0.51, 0.55, 0.6, 0.7.

A majority wiser than its members

Condorcet's other theorem turns voting round: the voters no longer have preferences but judgements about a single fact, each a little more likely right than wrong. Then a simple majority of many of them is almost certainly right — 6,763 voters who are each right 51% of the time make a majority right 95% of the time. The theorem survives voters worse than a coin, if the average is better. It does not survive voters who share their mistakes, and when their skills differ the right rule weighs votes rather than counting them.

applied · Voting rules
Tails of a sample drawn with and without replacement, against two bounds. t 0.000: without 1.00e+0, with 1.00e+0, Hoeffding 1.00e+0, Serfling 1.00e+0; t 0.075: without 2.65e-1, with 3.88e-1, Hoeffding 1.00e+0, Serfling 9.56e-1; t 0.150: without 1.35e-2, with 5.57e-2, Hoeffding 3.31e-1, Serfling 1.05e-1; t 0.225: without 1.10e-4, with 3.02e-3, Hoeffding 3.48e-2, Serfling 2.62e-3; t 0.300: without 1.19e-7, with 8.09e-5, Hoeffding 1.49e-3, Serfling 1.50e-5.

Drawn without putting back

Every concentration bound on this shelf assumes the draws are independent. A real sample is not: a pollster does not ring the same person twice, and every ball taken from an urn changes what is left in it. The dependence runs the helpful way. Wassily Hoeffding proved in 1963 that a sample drawn without replacement is at least as concentrated as one drawn with it, for every convex measure of spread at once — and the variance falls by an exact factor that reaches zero when the whole urn is taken.

probability · Concentration
How often each procedure finds the right verdict, with 3 judges of competence 0.7. both true: liable: premises 61.5%, conclusion 48.5%; first only: not liable: premises 83.1%, conclusion 88.6%; second only: not liable: premises 83.1%, conclusion 88.6%; neither: not liable: premises 95.3%, conclusion 97.7%; average 80.7% against 80.9%.

Which vote finds the truth more often

A court that must decide two premises and their conjunction can vote on the premises or on the conclusion, and the two votes sometimes disagree. Suppose there is a right answer and each judge is more often right than wrong. Then the question has an exact answer: for three judges the conclusion vote is more often right when competence is below √½ and the premise vote above it, and in a large court the premise vote wins at any competence — while the conclusion vote turns out to be a built-in standard of proof.

applied · Judgement aggregation
One weak element drags both procedures down. p1=0.55: premise 0.6331, verdict 0.5607; p1=0.6: premise 0.7535, verdict 0.6834; p1=0.7: premise 0.9218, verdict 0.8754; p1=0.8: premise 0.9883, verdict 0.9717; p1=0.9: premise 0.9997, verdict 0.9978

The element the judges are worst at

A court can vote element by element or on the verdict, and the comparison so far assumed judges equally good at every element. Real judges are surer about the law than about a contested fact. Make one element hard and both procedures sink towards the majority on that element, but they sink differently: the verdict vote sees only the product of the judges' competences and cannot tell an even court from a lopsided one, while the premise vote is ruled by its weakest majority. And when a judge's errors on two elements come from the same misreading of the facts, the gap between the procedures closes.

applied · Judgement aggregation
The median has a bell of its own. normal: median sd 0.1238 (pred 0.1247), mean spread 0.0985; laplace: median sd 0.1071 (pred 0.0995), mean spread 0.1405; cauchy: median sd 0.1588 (pred 0.1563), mean spread 1.5006

The middle value has a bell of its own

The central limit theorem is a theorem about sums, and the median of a sample is not a sum of anything. It has a bell all the same: the middle of n draws spreads like 1/(2f√n), where f is the height of the density at the middle — not the variance, which the median never consults. That one number decides when the median beats the average, by a factor of two for a two-sided exponential and outright for the Cauchy law; and where the density is nought at the middle, the bell fails, slowing to a fourth root or splitting in two.

probability · Central limit

Named alongside it

The objects these essays reach for when they reach for this one.

IndependenceCondorcet jury theoremCorrelationConvergenceHeavy tailsJudgement aggregationLaw of large numbersLimitMajority ruleNormal distributionVarianceApproximation

All concepts