Concept

Correlation

A measure of how two random quantities move together: positive when one tends to be high as the other is, negative when high goes with low. It is the covariance divided by both standard deviations, so it lies between −1 and 1 and ignores units.

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

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
Four records: rough or smooth, long memory or short. Four random records in a two-by-two grid, each drawn whole and close up; roughness shows in the close-ups and memory in the whole records, and the two vary independently.

Two numbers in one jagged record

A measured record comes with no rule, so its dimension has to be estimated from a finite stretch of samples — and two things go wrong that never trouble a graph built from a formula. The popular estimator depends on the units the record is written in, and the dimension, which describes the record up close, turns out to be independent of its memory, which describes it from far away. For a self-affine path the two are tied by D = 2 − H; for a record, they are two numbers.

dynamics · Fractal dimension
Every slice of a tilted bell is a bell, centred off the axis. Contour ellipses of a two-variable bell with correlation 0.6, five vertical slices drawn as bells, their centres on the line y = 0.6x, and the ellipses' long axis on the diagonal y = x.

Regression is a square completed halfway

A bell in two variables, sliced at a fixed x, is a bell in y — and completing the square in y alone says where it is centred: at ρx, on a line flatter than the ellipse's own axis. That gap is regression to the mean, and the same completion says it runs backwards in time just as well as forwards.

algebra · Completing the square
Two edges of a small graph, and whether one makes the other less likely. tree: 8 total, 5 with e, 5 with f, 3 with both, ratio 0.9600; forest: 24 total, 10 with e, 10 with f, 4 with both, ratio 0.9600; connected: 14 total, 10 with e, 10 with f, 7 with both, ratio 0.9800.

Edges that crowd each other out

Pick a spanning tree of a graph uniformly at random, and the presence of one edge makes every other edge less likely — a theorem of Kirchhoff's electricity. Pick a forest instead, or a connected subgraph, and the same is believed and unproved. Checking every pair of edges in every labelled graph up to six vertices, 871,926 pairs for forests alone, finds no exception, and comes as close as 0.9994 to one.

probability · Concentration
The largest primes of n and n + 1, side by side. Joint law of t(n), t(n+1) for 1000≤n<1e7 in 24×24 cells: corner (both near prime) 0 against 44149 expected; other ratios 0.268 to 2.582.

Two neighbours share out their small primes

A number and the next one have no prime in common, and the natural guess is that their largest primes are independent. In the limit that is believed and nearly proved. Below ten million it is visibly false: neighbours are both made of small primes only nine-tenths as often as independence predicts, a run of four only two-thirds as often, and the correlation between their largest primes is negative at distance one and positive at distance six — because a small prime that divides one of two neighbours is a small prime the other cannot have.

number · Unique factorisation
The correlations that reverse a coefficient. rho = 0.6: wedge shares 0.2051 and 0.2051 of the ellipse; arcsin(0.6)/pi = 0.2048.

Holding one still turns the other over

A quantity can rise with an outcome and still predict it downwards once a second quantity is held fixed. Completing the square in two predictors says exactly when: the pair of correlations has to fall in a wedge whose angle is arcsin of the predictors' own correlation. Averaged over every possible correlation matrix the chance is exactly 1/4 − 1/π², about one coefficient in seven; two coefficients never reverse together, and with two dozen predictors almost two in five do.

algebra · Completing the square
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

Named alongside it

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

VarianceBinomial distributionCompleting the squareConditional probabilityCondorcet jury theoremIndependenceNormal distributionProjectionQuadratic formSimulationBayes' theoremBox dimension

All concepts