Math paradoxes

Glossary / Poisson process

Glossary · Poisson process

Were the flying bombs aimed at particular districts of London?

In the summer of 1944 German V-1 flying bombs were falling on London. Some districts took several hits while others stood untouched. Londoners said more and more often that the bombs fell in clusters, so they must be aimed at something. Two years later the actuary R. D. Clarke tested this with a simple table. Before finding out what he saw, take a look at what real randomness looks like.

In plain wordspictures, analogies, small numbers

“In plain words” is hidden on all puzzles.

The paradox of the aimed rain

A grid of 144 squares, and drops are falling on it. Each drop lands in a completely random spot, none knows about the others, and no square is any better than its neighbour. Drop some and look at the pattern.

Drops0
Empty squares144
Most in one square0

Clumps are what chance looks like

When people are asked to draw random dots, they spread them neatly, one per cell, like the second pattern. Real chance can't do that. If the drops know nothing about each other, nothing stops two or three from landing side by side while the neighbouring square stays dry. Clumps and empty patches appear by themselves, with no aiming at all. It's the even grid that would be suspicious.

Rigoroustables, charts, formulas

“Rigorous” is hidden on all puzzles.

What a Poisson process is

A Poisson process is a stream of events that happen independently of each other, at the same average rate λ, and never two at exactly the same instant. The rate can be per hour, per page or per square kilometre. Then the number of events in a piece of size 1 has the Poisson distribution, named after the French mathematician Siméon Denis Poisson:

P(k) = λᵏ · e−λ / k!

An example. Say a book has on average 2 typos per page, λ = 2:

0 typos13.5%
1 typo27.1%
2 typos27.1%
3 typos18.0%
4 or more14.3%

A page with no typos at all is almost as common as a page with four or more. Both are the ordinary play of chance, not a "careful" or "careless" day for the proofreader.

The grid against the formula

Count the squares: how many are empty, how many hold one drop, two, three… And compare with what the Poisson formula promises with λ = number of drops / 144. Now London. Clarke took 144 km² of south London, divided it into 576 squares of ¼ km² each and counted 537 hits in them, on average 537 / 576 ≈ 0.93 per square.

actual squaresby the Poisson formula

When a stream is Poisson, and when it isn't

  • Calls to a call centreWithin a quiet hour, yes. Thousands of people independently decide to call, each with a small probability. So there are minutes when five call at once and minutes of silence, though nothing has happened.
  • Geiger counter clicksYes, the textbook case. Each radioactive nucleus decays on its own, ignoring its neighbours, so the clicks come in bursts and lulls.
  • Typos per pageRoughly, if the text is uniform. But a tired typesetter at the end of the day means a higher rate on those pages.
  • Rush hourNo. The rate isn't constant: there are far more people on the metro at 8:30 than at 14:00. Mix those hours into one table and you get more empty and more crowded intervals than the formula gives.
  • Events that trigger othersNo. A big earthquake brings aftershocks, one repost pulls in a dozen more. Here the clumps are real, made by a cause, not by chance.
  • Events that come in groupsNo. Friends arrive at a café as a group, so the number of guests jumps by three or four at once. Count groups instead of people and the stream may become Poisson again.
Deepergeneralisations, theory, history

“Deeper” is hidden on all puzzles.

Many tiny chances

C(n, k) · (λ/n)ᵏ · (1 − λ/n)n−k → λᵏ · e−λ / k!   as n → ∞

Split a square into n tiny cells, and let a drop land in each one independently with probability λ/n. The number of drops is then binomial. When there are very many cells, (1 − λ/n)ⁿ tends to e−λ and C(n, k) / nᵏ to 1/k!, and out comes the Poisson formula. That is why it describes anything made of many rare independent chances: thousands of callers, billions of nuclei, thousands of letters on a page. Move the slider, λ = 1.

The mean equals the variance

E[K] = Σ k · λᵏe−λ/k! = λ · Σ λk−1e−λ/(k−1)! = λ

E[K(K − 1)] = λ²  ⇒  Var K = λ² + λ − λ² = λ

For a Poisson process the mean and the variance are equal, and that makes a handy test. If the variance is clearly larger than the mean, events really do clump, as at rush hour or after an earthquake. If it is clearly smaller, they are spread more evenly than chance allows, as in the "chance as people imagine it" pattern. In London the mean is 0.932 hits per square and the variance 0.969, taking the largest square to have had 7 hits, which is exactly what remains of the 537 in total. The ratio is 1.04, so there are no clumps beyond chance. Clarke himself checked the fit with a chi-squared test: χ² = 1.17 with 4 degrees of freedom.

Drop some rain on the grid above, and the mean and variance of your squares will appear here.

Two streams merge into one

P(K₁ + K₂ = k) = Σj e−λ₁λ₁ʲ/j! · e−λ₂λ₂k−j/(k−j)! = e−(λ₁+λ₂) (λ₁ + λ₂)ᵏ / k!

The last equality is the binomial theorem. If a call centre independently gets on average 0.5 calls a minute from Kyiv and 1 a minute from Lviv, the calls together are again a Poisson process with λ = 1.5. Check it over 10,000 minutes.

Where it shows up

Other terms