Poisson Distribution

Essential
Last updated: Tags: Probability, Random Variables, Distributions

Prerequisites

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\lambda > 0 events on average. Divide the window into nn 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=λ/np = \lambda/n, and all sub-intervals are independent.

The number of events is then Bin(n,λ/n)\operatorname{Bin}(n, \lambda/n). Fix kk and let nn \to \infty:

P(X=k)=(nk)(λn)k(1λn)nk.P(X = k) = \binom{n}{k}\left(\frac{\lambda}{n}\right)^k\left(1 - \frac{\lambda}{n}\right)^{n-k}.

Expand each factor in turn.

Binomial coefficient:

(nk)=n(n1)(nk+1)k!nkk!as n,\binom{n}{k} = \frac{n(n-1)\cdots(n-k+1)}{k!} \to \frac{n^k}{k!} \quad \text{as } n \to \infty,

because kk is fixed while nn grows, so each of the kk factors (nj)/n1(n - j)/n \to 1.

Power of pp:

(λn)k=λknk.\left(\frac{\lambda}{n}\right)^k = \frac{\lambda^k}{n^k}.

Tail factor:

(1λn)nk=(1λn)n(1λn)keλ1=eλ,\left(1 - \frac{\lambda}{n}\right)^{n-k} = \left(1 - \frac{\lambda}{n}\right)^n \cdot \left(1 - \frac{\lambda}{n}\right)^{-k} \to e^{-\lambda} \cdot 1 = e^{-\lambda},

using the standard limit limn(1λ/n)n=eλ\lim_{n\to\infty}(1 - \lambda/n)^n = e^{-\lambda} and the fact that (1λ/n)k1(1 - \lambda/n)^{-k} \to 1.

Putting it together:

P(X=k)nkk!λknkeλ=eλλkk!.P(X = k) \to \frac{n^k}{k!} \cdot \frac{\lambda^k}{n^k} \cdot e^{-\lambda} = \frac{e^{-\lambda}\lambda^k}{k!}.

Definition

A random variable XX has the Poisson distribution with rate λ>0\lambda > 0, written XPoisson(λ)X \sim \operatorname{Poisson}(\lambda), if its PMF is:

P(X=k)eλλkk!,k=0,1,2,P(X = k) \coloneqq \frac{e^{-\lambda}\lambda^k}{k!}, \qquad k = 0, 1, 2, \ldots

Verification: the PMF sums to 1

k=0eλλkk!=eλk=0λkk!=eλeλ=1.\sum_{k=0}^{\infty} \frac{e^{-\lambda}\lambda^k}{k!} = e^{-\lambda} \sum_{k=0}^{\infty} \frac{\lambda^k}{k!} = e^{-\lambda} \cdot e^{\lambda} = 1. \checkmark

The series k=0λk/k!=eλ\sum_{k=0}^{\infty} \lambda^k / k! = e^{\lambda} is the Taylor expansion of the exponential function.

Mean: E[X]=λE[X] = \lambda

E[X]=k=0keλλkk!.E[X] = \sum_{k=0}^{\infty} k \, \frac{e^{-\lambda}\lambda^k}{k!}.

The k=0k = 0 term vanishes. For k1k \geq 1, cancel kk with k!k!:

E[X]=eλk=1λk(k1)!=eλλj=0λjj!=eλλeλ=λ.E[X] = e^{-\lambda} \sum_{k=1}^{\infty} \frac{\lambda^k}{(k-1)!} = e^{-\lambda} \cdot \lambda \sum_{j=0}^{\infty} \frac{\lambda^j}{j!} = e^{-\lambda} \cdot \lambda \cdot e^{\lambda} = \lambda.

The mean equals the rate parameter — a reassuring sanity check given how λ\lambda was defined.

Variance: Var(X)=λ\operatorname{Var}(X) = \lambda

Compute E[X(X1)]E[X(X-1)] first:

E[X(X1)]=k=2k(k1)eλλkk!=eλλ2j=0λjj!=λ2.E[X(X-1)] = \sum_{k=2}^{\infty} k(k-1)\frac{e^{-\lambda}\lambda^k}{k!} = e^{-\lambda}\lambda^2 \sum_{j=0}^{\infty}\frac{\lambda^j}{j!} = \lambda^2.

Therefore E[X2]=E[X(X1)]+E[X]=λ2+λE[X^2] = E[X(X-1)] + E[X] = \lambda^2 + \lambda, and:

Var(X)=E[X2](E[X])2=(λ2+λ)λ2=λ.\operatorname{Var}(X) = E[X^2] - (E[X])^2 = (\lambda^2 + \lambda) - \lambda^2 = \lambda.

Both the mean and the variance of a Poisson random variable equal λ\lambda. 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 XPoisson(λ1)X \sim \operatorname{Poisson}(\lambda_1) and YPoisson(λ2)Y \sim \operatorname{Poisson}(\lambda_2) are independent, then:

X+YPoisson(λ1+λ2).X + Y \sim \operatorname{Poisson}(\lambda_1 + \lambda_2).

Proof. By the convolution formula:

P(X+Y=k)=j=0kP(X=j)P(Y=kj)=j=0keλ1λ1jj!eλ2λ2kj(kj)!.P(X + Y = k) = \sum_{j=0}^{k} P(X = j)\,P(Y = k - j) = \sum_{j=0}^{k} \frac{e^{-\lambda_1}\lambda_1^j}{j!} \cdot \frac{e^{-\lambda_2}\lambda_2^{k-j}}{(k-j)!}.

Factor out e(λ1+λ2)/k!e^{-(\lambda_1+\lambda_2)} / k! and apply the binomial theorem:

P(X+Y=k)=e(λ1+λ2)k!j=0k(kj)λ1jλ2kj=e(λ1+λ2)(λ1+λ2)kk!.P(X + Y = k) = \frac{e^{-(\lambda_1+\lambda_2)}}{k!} \sum_{j=0}^{k}\binom{k}{j}\lambda_1^j\lambda_2^{k-j} = \frac{e^{-(\lambda_1+\lambda_2)}(\lambda_1+\lambda_2)^k}{k!}. \qquad \square

This additivity reflects the physical intuition: if events arrive from two independent Poisson processes with rates λ1\lambda_1 and λ2\lambda_2, the merged stream is Poisson with rate λ1+λ2\lambda_1 + \lambda_2.

Summary

  • XPoisson(λ)X \sim \operatorname{Poisson}(\lambda) is the limit of Bin(n,λ/n)\operatorname{Bin}(n, \lambda/n) as nn \to \infty, and models counts of rare independent events in a fixed window.
  • PMF: P(X=k)=eλλk/k!P(X = k) = e^{-\lambda}\lambda^k / k! for k=0,1,2,k = 0, 1, 2, \ldots
  • Mean and variance are both equal to λ\lambda.
  • Additivity: the sum of independent Poisson(λ1)(\lambda_1) and Poisson(λ2)(\lambda_2) variables is Poisson(λ1+λ2)(\lambda_1 + \lambda_2).