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 4 essays across 4 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

Named alongside it

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

VarianceBinomial distributionBayes' theoremBox dimensionCompleting the squareConcentration inequalityConditional probabilityCondorcet jury theoremConvexityExpectationFractal dimensionFractional brownian motion

All concepts