Repository navigation
1.2.? Poisson
A machine turns its gears.
Not rhythmically. Not predictably. But events happen.
A click. Another. Silence. Then three in a row.
This is not pure chaos.
It is randomness with structure.
And this is where the Poisson distribution begins.
The Poisson distribution answers a very particular kind of question:
How many times does something happen in a fixed interval?
That interval may be:
- a stretch of time
- a region of space
- a segment of material
- or any bounded domain in which events may occur
Examples:
- How many emails arrive in one hour?
- How many cars pass a checkpoint in ten minutes?
- How many typos appear in one page?
- How many mutations occur in a strand of DNA?
- How many stars are found in a small patch of sky?
This is already a clue:
Poisson is not about measuring how much. It is about counting how many events occur.
Some random variables measure values:
- height
- weight
- temperature
- speed
Poisson does not.
Poisson counts occurrences.
The random variable is something like:
“number of arrivals” “number of failures” “number of calls” “number of impacts”
So the possible values are:
This makes Poisson a discrete distribution.
The Poisson distribution appears when events:
- occur independently
- happen with a stable average rate
- are counted over a fixed interval
- are individually rare, even if many opportunities exist
This combination matters.
It means the world is not following a clock, but neither is it arbitrary in the wildest sense. There is a stable background tendency, and on top of that tendency, individual events appear unpredictably.
That is the Poisson world.
Poisson is governed by a single parameter:
This lambda represents the expected number of events in the interval.
If on average 3 customers arrive every 10 minutes, then:
If on average 12 radioactive emissions are detected per second, then:
If on average 0.4 printing errors appear per page, then:
So
If a random variable
where:
$k = 0, 1, 2, 3, \dots$ $\lambda > 0$
This formula gives the probability of seeing exactly
A formula should not be treated as sacred decoration. It should be read.
Let us slow it down:
This reflects the pressure toward producing
This compensates for overcounting arrangements. When several events happen, their ordering inside the count does not matter.
This is the damping factor. It prevents the probabilities from exploding and ensures the whole distribution sums to 1.
So the formula is not a random artifact. It balances:
- the tendency for events to occur
- the combinatorial correction
- the normalization that keeps probability coherent
This is the part that turns memorization into understanding.
Poisson is what emerges when you have:
- many opportunities
- each with tiny probability
- but with a stable expected total
That should sound familiar.
It is the logic of the binomial distribution pushed into a special limit.
If:
then the expected number of successes is:
Now imagine:
-
$n$ becomes very large -
$p$ becomes very small - but the product stays constant
Then the binomial model approaches the Poisson model:
This is one of the most important conceptual facts about Poisson.
It is not just “a counting formula.” It is the natural shape of rare events aggregated over many chances.
You can imagine time split into many tiny slices.
In each tiny slice:
- either nothing happens
- or one event happens
If the slices are tiny enough, multiple events in the same slice become negligible.
Most slices contain nothing. A few contain one event. Across the full interval, those tiny possibilities accumulate.
That accumulation is Poisson.
flowchart LR
A[Many tiny opportunities] --> B[Each event is rare]
B --> C[Average rate stays stable]
C --> D[Count total events]
D --> E[Poisson distribution]
Here is the feeling of a Poisson process in time:
timeline
title Random arrivals in one interval
00:00 : no event
00:08 : event
00:21 : no event
00:37 : event
00:41 : event
00:58 : no event
Notice what matters:
- not regular spacing
- not a deterministic rhythm
- but a count over the interval
Poisson does not care exactly when each event occurs inside the interval. It cares about how many occurred.
Suppose a help desk receives, on average, 4 requests per hour.
Then:
What is the probability of receiving exactly 2 requests in one hour?
Using the formula:
Numerically,
So there is about a 14.65% chance of receiving exactly two requests in that hour.
When
When
flowchart TD
A[Small λ] --> B[Most mass near 0]
C[Moderate λ] --> D[Mass spreads over several counts]
E[Large λ] --> F[Distribution becomes more bell-like]
This gives a useful intuition:
- small rate → events are scarce
- large rate → events are more common
- larger
$\lambda$ also means larger variability in absolute terms
A remarkable property of the Poisson distribution is this:
and also
So in a Poisson model:
- the mean equals
$\lambda$ - the variance also equals
$\lambda$
This is elegant, and also diagnostically useful.
If observed count data has variance much larger than the mean, a plain Poisson model may be too simple.
Poisson is one of the first places where probability feels like a real language of the world.
It tells us that even when individual events are unpredictable, aggregate behavior may still be mathematically intelligible.
That is a deep idea.
A single arrival is uncertain. But the pattern of arrivals is not beyond thought.
Poisson is one answer to a larger question:
How can disorder still produce a stable form?
Poisson tends to be appropriate when:
- you count events in a fixed interval
- events are approximately independent
- the average rate is roughly constant
- simultaneous events are negligible
- the count is not naturally capped by a small fixed number of trials
Examples include:
- arrivals
- accidents
- defects
- emissions
- failures
- calls
- mutations
Poisson can fail when:
- events affect one another
- the rate changes over time
- counts cluster in bursts
- data contains too many zeros
- variance is much larger than the mean
In those cases, we may need richer models.
This matters because technical correctness is not just about applying a formula. It is about recognizing whether reality actually matches the assumptions.
These two distributions are close cousins, but they are not the same thing.
Ask:
How many successes occur in a fixed number of trials?
- fixed number of attempts
- each trial has success/failure
- parameterized by
$n$ and$p$
Ask:
How many events occur in a fixed interval?
- no explicit fixed number of trials
- events arise over time or space
- parameterized by
$\lambda$
A useful way to think about it:
- Binomial counts success across a known set of chances
- Poisson counts events when the chances are too many or too small to track individually
flowchart LR
A[Binomial] --> B[Fixed number of trials]
B --> C[Success / failure]
C --> D[np = expected count]
D --> E[If n is large and p is small]
E --> F[Poisson approximation]
G[Poisson] --> H[Fixed interval]
H --> I[Count of events]
Poisson is the mathematics of scattered happenings.
Not one large event. Not a measured magnitude. But many small possible occurrences, each uncertain, together producing a stable statistical shape.
It is the distribution of:
- arrivals without schedule
- defects without intention
- emissions without rhythm
- coincidences under a constant background tendency
In this sense, Poisson is one of probability’s most revealing ideas:
randomness can have architecture
A Poisson random variable counts how many times an event occurs in a fixed interval when:
- events are independent
- the average rate is constant
- individual events are rare
- we care about the total count
Its formula is:
Its mean and variance are both:
And its conceptual origin is the limit of many tiny chances accumulating into a finite expected count.
That is not just a formula.
That is a worldview.
import math
λ = 4
k = 2
probability = (λ**k) * math.exp(-λ) / math.factorial(k)
probability
You should obtain approximately:
0.1465
-
A website receives on average 6 visits per minute. What is the probability of receiving exactly 8 visits in one minute?
-
A book has on average 0.3 typos per page. What is the probability that a page has no typos?
-
Explain, in words, why Poisson can be understood as a limit of the binomial distribution.
-
Give one real process that is plausibly Poisson and one that is not. Justify both.
Legend:
- 🔰 Start here
- 🏵️ Important Insight
- ⚙️ Technical and applications
- 💻 Some Code
- ⚜️ Advanced Topics
- 00.1 What Is Data?
-
00.2 Three Models of Reality (planned)
- 00.2.1 The Linguistic
- 00.2.2 The Symbolic
- 00.3.3 The Mathematical
- 00.3 Maps and Reality
- 00.4 Aside: Hossack, data as structure
- 00.5 Aside: Chomsky, data as evidence
- 01.1 🔰 Sets and Logic (planned)
- 01.2 Sample Space
- 01.3 Randomness and Pattern
- 01.4 Outcomes and Events
- 01.5 Finite and Infinite Sample Spaces
- 02.1 🔰 Functions (planned)
- 02.2 Types Are Alphabets
- 02.3 Random Variables: X : Ω → 𝒳 (planned)
- 02.4 Measurement Scales
- 02.5 Numerics
- 03.1 🔰 Fractions and Proportions (planned)
- 03.2 Randomness vs Uncertainty
- 03.3 Probability: Events, Conditioning, Bayes
- 03.4 Bayes' Theorem, Step by Step
- 03.5 Expected Value and Variance (planned)
- 03.6 Bernoulli (ES)
- 03.7 Discrete Uniform (ES)
- 03.8 🧗 Kolmogorov: Ω, 𝒜, ℙ
- 04.1 🔰 Powers and Logarithms (planned)
- 04.2 Rarity
- 04.3 Information Theory (Shannon)
- 04.4 Entropy: Three Views
- 05.1 🔰 Sums and Averages (planned)
- 05.2 Data, Measured
- 05.3 Sampling (ES)
- 05.4 Population and Sample (ES)
- 05.5 Types of Sampling (ES)
- 05.6 Choosing Summaries & Visuals
- 05.7 Visualization
- 05.8 Plots
- 06.1 What Is Statistics?
- 06.2 🔰 Curves and Area (planned)
- 06.3 Statistical Thinking
- 06.4 Variation
- 06.5 Uncertainty
- 06.6 Parameters vs Estimators (ES)
- 06.7 Distributions
- 06.8 Statistical Modeling
- 06.9 Statistical Methods
- 07.1 Data Storage: Databases (stub)
- 07.2 ER Diagrams
- 07.3 Chen Diagrams
- 07.4 SQL (planned)
- 07.5 Formal Languages and Regular Expressions (planned)
- 07.6 Reproducibility (planned)
08 · μ(x) — Fuzzy - When data is flexible
- 08.1 Fuzzy Logic (planned)
- 08.2 Fuzzy Numbers (planned)
- 08.3 Possibility vs Probability (planned)
09 · x(t) — Signals and systems - Where patterns live
- 09.1 Signals (stub)
- 09.2 Sampling and Aliasing (planned)
- 09.3 Convolution (planned)
- 09.4 Frequency (planned)
- 10.1 🔰 Vectors and Matrices (planned)
- 10.2 Mathematical Modelling (planned)
- 11.1 🔰 Derivatives (planned)
- 11.2 Convex Optimisation (planned)
- 12.1 Supervised Learning (planned)
- 12.2 Data in Language Models
- 13.1 Cause and Effect (planned)
- 13.2 Capstone Guide (planned)