Motivation
The Poisson distribution models the number of events occurring in a fixed interval (time, space, etc.) when events occur:
- Independently of each other
- At a constant average rate
- One at a time
Examples:
- Number of emails arriving in an hour
- Number of typos per page
- Number of earthquakes per year in a region
- Number of customers entering a shop per hour
Preview: The Constant e
The Poisson distribution uses the mathematical constant e≈2.71828.
Key identities:
e=∑n=0∞n!1,ex=∑n=0∞n!xn
e−λ=limn→∞(1−nλ)n
Definition
X∼Poisson(λ) if:
P(X=k)=k!λke−λ,k=0,1,2,…
The parameter λ>0 is both the mean and the variance.
Range
X∈{0,1,2,3,…} (all non-negative integers)
Expectation
E[X]=∑k=0∞k⋅k!λke−λ=e−λ∑k=1∞(k−1)!λk=e−λ⋅λ∑k=1∞(k−1)!λk−1=e−λ⋅λ⋅eλ=λ
Variance
By similar calculation: Var(X)=λ.
Not a coincidence: The mean and variance are equal for Poisson. This is a distinguishing feature.
Derivation from Binomial
Let Y∼Bin(n,p). If n→∞ and p→0 with np=λ fixed:
Bin(n,p)→Poisson(λ)
Intuition
Consider events occurring over time. Divide the interval into n tiny subintervals:
- Each subinterval has probability p=λ/n of containing an event
- Number of events in the whole interval is Bin(n,p)
- As n→∞, this approaches Poisson(λ)
Proof Sketch
P(Y=k)=(kn)pk(1−p)n−k=k!n(n−1)⋯(n−k+1)(nλ)k(1−nλ)n−k
As n→∞:
- nkn(n−1)⋯(n−k+1)→1
- (1−λ/n)n−k→e−λ
Result: P(X=k)=k!λke−λ
Example: Call Centre
A call centre receives an average of 5 calls per minute. What is the probability of exactly 3 calls in a minute?
X∼Poisson(λ=5)
P(X=3)=3!53e−5=6125×0.00674≈0.14
What is the probability of at most 2 calls?
P(X≤2)=P(X=0)+P(X=1)+P(X=2)=e−5(1+5+225)=18.5e−5≈0.125
Example: Rare Events
If events are rare (small p), but we have many trials (large n), use Poisson as an approximation to Binomial.
Earthquakes: Suppose there’s a 0.001 chance of a major earthquake each year. In 1000 years, expected number is λ=1.
P(at least one in 1000 years)=1−P(X=0)=1−e−1≈0.632
Poisson Process
A Poisson process with rate λ satisfies:
- N(0)=0 (no events at time 0)
- Independent increments: counts in disjoint intervals are independent
- N(t)∼Poisson(λt): number of events in time interval of length t
The inter-arrival times are exponentially distributed with parameter λ.
Additivity
If X∼Poisson(λ1) and Y∼Poisson(λ2) are independent:
X+Y∼Poisson(λ1+λ2)
Intuition: Merging two independent streams of events at rates λ1 and λ2 gives rate λ1+λ2.
Summary Table
| Property | Value |
|---|
| PMF | P(X=k)=k!λke−λ |
| Range | {0,1,2,…} |
| Mean | λ |
| Variance | λ |
| Relation to binomial | Limit of Bin(n,p) as n→∞, np=λ |