Radioactive decay events per second, typos per page, server requests per minute — whenever you count how many times a rare, independent event happens in a fixed window, the Poisson distribution is the natural model.
The Poisson limit
The cleanest way to arrive at the Poisson PMF is to take a limit of the Binomial distribution. Suppose you observe a process over a fixed window and expect a total of λ>0 events on average. Divide the window into n equal sub-intervals, each so short that at most one event can fall in it. The probability of an event in any one sub-interval is approximately p=λ/n, and all sub-intervals are independent.
The number of events is then Bin(n,λ/n). Fix k and let n→∞:
P(X=k)=(kn)(nλ)k(1−nλ)n−k.
Expand each factor in turn.
Binomial coefficient:
(kn)=k!n(n−1)⋯(n−k+1)→k!nkas n→∞,
because k is fixed while n grows, so each of the k factors (n−j)/n→1.
Power of p:
(nλ)k=nkλk.
Tail factor:
(1−nλ)n−k=(1−nλ)n⋅(1−nλ)−k→e−λ⋅1=e−λ,
using the standard limit limn→∞(1−λ/n)n=e−λ and the fact that (1−λ/n)−k→1.
Putting it together:
P(X=k)→k!nk⋅nkλk⋅e−λ=k!e−λλk.
Definition
A random variable X has the Poisson distribution with rate λ>0, written X∼Poisson(λ), if its PMF is:
P(X=k):=k!e−λλk,k=0,1,2,…
Verification: the PMF sums to 1
k=0∑∞k!e−λλk=e−λk=0∑∞k!λk=e−λ⋅eλ=1.✓
The series ∑k=0∞λk/k!=eλ is the Taylor expansion of the exponential function.
Mean: E[X]=λ
E[X]=k=0∑∞kk!e−λλk.
The k=0 term vanishes. For k≥1, cancel k with k!:
E[X]=e−λk=1∑∞(k−1)!λk=e−λ⋅λj=0∑∞j!λj=e−λ⋅λ⋅eλ=λ.
The mean equals the rate parameter — a reassuring sanity check given how λ was defined.
Variance: Var(X)=λ
Compute E[X(X−1)] first:
E[X(X−1)]=k=2∑∞k(k−1)k!e−λλk=e−λλ2j=0∑∞j!λj=λ2.
Therefore E[X2]=E[X(X−1)]+E[X]=λ2+λ, and:
Var(X)=E[X2]−(E[X])2=(λ2+λ)−λ2=λ.
Both the mean and the variance of a Poisson random variable equal λ. This equality is a useful diagnostic: if you observe count data and the sample mean and sample variance differ substantially, a Poisson model may not fit.
Additive property
If X∼Poisson(λ1) and Y∼Poisson(λ2) are independent, then:
X+Y∼Poisson(λ1+λ2).
Proof. By the convolution formula:
P(X+Y=k)=j=0∑kP(X=j)P(Y=k−j)=j=0∑kj!e−λ1λ1j⋅(k−j)!e−λ2λ2k−j.
Factor out e−(λ1+λ2)/k! and apply the binomial theorem:
P(X+Y=k)=k!e−(λ1+λ2)j=0∑k(jk)λ1jλ2k−j=k!e−(λ1+λ2)(λ1+λ2)k.□
This additivity reflects the physical intuition: if events arrive from two independent Poisson processes with rates λ1 and λ2, the merged stream is Poisson with rate λ1+λ2.
Summary
- X∼Poisson(λ) is the limit of Bin(n,λ/n) as n→∞, and models counts of rare independent events in a fixed window.
- PMF: P(X=k)=e−λλk/k! for k=0,1,2,…
- Mean and variance are both equal to λ.
- Additivity: the sum of independent Poisson(λ1) and Poisson(λ2) variables is Poisson(λ1+λ2).