Concept

Discrepancy

A measure of how unevenly a set of points fills a region: the largest gap, over all boxes, between a box's share of the points and its share of the volume. Low discrepancy is what makes a point set good for numerical integration.

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

Points too even to be random. 256 independent random points beside 256 points of a Halton sequence, with the largest mismatch between a box's share of points and its area plotted against the number of points for both.

Points too even to be random

Independent random points clump, and the clumping is what makes the error fall only as the square root. Points chosen to be evenly spread rather than independently beat that rate, and the price is that nothing about them is random at all.

probability · Monte Carlo
Integration error against the number of points: lattice, Halton and random, on a smooth periodic function. Log-log plot of integration error against N for random points (slope -0.47), Halton points (-0.96) and Fibonacci lattices (-1.83).

Points on a lattice that see almost nothing

Average a function over the points of a carefully tilted lattice and the error can fall like one over the square of the number of points — far faster than random sampling, and faster than the most evenly spread sequences. The reason is that a lattice rule is blind to only a thin set of frequencies, its dual lattice, and a smooth periodic function has almost nothing there.

probability · Monte Carlo
The 46 Farey fractions of order 12, and how far each strays from even spacing. Farey fractions of order 12 against 46 evenly spaced points, with the deviation of each drawn as a bar; largest deviation 0.0616.

How evenly the fractions spread

List every fraction between nought and one with denominator at most n, in order. They spread across the interval almost evenly, and how fast the unevenness shrinks as n grows is — exactly, provably — the Riemann hypothesis. The link runs through a second fact: set the fractions round a circle and add them as arrows, and what is left is a whole number.

number · Stern brocot
Where a jump puts the error of evenly spread points. Three unit squares with 16, 64, 256 scrambled Sobol' points, one per box, and the line y = 0.15 + 0.7x crossing 6, 12, 26 boxes.

What a jump costs evenly spread points

Scrambled Sobol' points integrate a smooth function with an error that falls like N to the power −3/2. Put a jump in the integrand along a tilted line and the exponent halves, to −3/4, because about √N of the N boxes the points fill are cut by the jump and each of those is left to chance. A jump along an axis costs almost nothing, the cost grows with the length of the jump and the dimension, and integrating across the jump before sampling gives the whole rate back.

probability · Monte Carlo
Each prime of the form 4k + 1 as a point on its own circle. Points (a, b) with a > b > 0 and a² + b² prime, for the 1125 such primes below 20000, filling the sector between 0° and 45°.

Which way a prime's two squares point

A prime one more than a multiple of four is a sum of two squares in exactly one way, and the two squares make a point on a circle. Draw that point for every such prime and ask which way it faces. It faces every way equally — the angles spread evenly over the sector, which Hecke proved by giving each angle a remainder and copying Dirichlet. Measured over seventy-four thousand primes, they are even more evenly spread than random angles would be.

number · Sums of two squares

Named alongside it

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

EquidistributionConvergence rateLatticeNumerical integrationQuasi-monte carloCurse of dimensionalityDirichlet theoremDual latticeError boundFarey sequenceFourier seriesGaussian integers

All concepts