Poisson Processes

⚡ Key Takeaways

A Poisson process is a model for events occurring randomly and independently in time (or space) at a constant average rate $\lambda$ . The number of events in any interval of length $t$ follows a Poisson distribution with mean $\lambda t$ , and the waiting times between events are independent exponential random variables. It applies wherever rare, memoryless events accumulate — radioactive decay, customer arrivals, photon detection, telephone calls. Introduced via Poisson's 1837 distribution and developed into a stochastic process by the early 20th century (Erlang, Lundberg).

💡 The Core Insight

Memorylessness made into a process. The defining property is that the future evolution of the process depends only on the present, not the past — and the rate never changes. This single assumption (stationary, independent increments with no simultaneous events) forces both the Poisson count distribution and the exponential inter-arrival times. The Poisson process is the unique continuous-time analogue of repeated independent coin flips made infinitely frequent and infinitely rare in just the right balance.

DefinitionCounting Process

A stochastic process $\{N(t): t\geq 0\}$ is a counting process if $N(t)$ represents the total number of events in $[0,t]$ and satisfies:

$N(t) \geq 0$ and $N(0) = 0$ ,
$N(t)$ is integer-valued,
if $s < t$ then $N(s) \leq N(t)$ ,
for $s<t$ , $N(t)-N(s)$ equals the number of events in $(s,t]$ .

DefinitionPoisson Process — Axiomatic Definition

A counting process $\{N(t)\}$ is a Poisson process with rate $\lambda > 0$ if: 1. $N(0)=0$ ; 2. Independent increments: the numbers of events in disjoint intervals are independent; 3. Stationary increments: the distribution of the number of events in an interval depends only on its length; 4. The number of events in any interval of length $t$ is Poisson distributed:

1

\quad P\{N(t+s)-N(s) = n\} = e^{-\lambda t}\frac{(\lambda t)^n}{n!}, \qquad n = 0,1,2,\dots

Derivation hint: This is the Poisson pmf with parameter $\lambda t$ ; it follows from the infinitesimal axioms below via a differential equation, shown in the proof. Here $\lambda$ is the rate or intensity (events per unit time), $t$ is the interval length, and $n$ the event count.

DefinitionPoisson Process — Infinitesimal (Local) Definition

An equivalent definition replaces axiom 4 with local conditions. As $h \to 0$ :

2

\quad P\{N(h)=1\} = \lambda h + o(h), \qquad P\{N(h)\geq 2\} = o(h), \qquad P\{N(h)=0\}=1-\lambda h + o(h)

Derivation hint: $o(h)$ denotes terms vanishing faster than $h$ ; these encode "at most one event in a tiny window" — orderliness — plus a constant per-unit hazard.

TheoremEquivalence of Definitions

The axiomatic definition and the infinitesimal definition are equivalent: a counting process with $N(0)=0$ , stationary independent increments, and the orderliness conditions [2] satisfies [1], and conversely.

TheoremInter-arrival and Waiting Times

Let $T_1, T_2, \dots$ be the inter-arrival times (time between consecutive events) and $S_n = \sum_{k=1}^n T_k$ the arrival time of the $n$ -th event. Then:

3

\quad T_n \overset{\text{iid}}{\sim} \text{Exponential}(\lambda), \qquad P\{T_n > t\} = e^{-\lambda t}

Derivation hint: $\{T_1 > t\} = \{N(t)=0\}$ , which has probability $e^{-\lambda t}$ by [1]; independence and stationarity extend this to all $T_n$ .

4

\quad S_n \sim \text{Gamma}(n,\lambda), \qquad f_{S_n}(t) = \lambda e^{-\lambda t}\frac{(\lambda t)^{n-1}}{(n-1)!}, \quad t\geq 0

Derivation hint: $S_n$ is a sum of $n$ iid exponentials; convolve, or differentiate $P\{S_n \leq t\} = P\{N(t)\geq n\}$ using [1].

ProofDeriving the Poisson Distribution from the Infinitesimal Axioms

Let $P_n(t) = P\{N(t)=n\}$ . We derive [1] from [2].

Step 1 — Probability of zero events. Using independent and stationary increments,

P_0(t+h) = P\{N(t)=0,\ N(t+h)-N(t)=0\} = P_0(t)\,P_0(h).

By [2], $P_0(h) = 1-\lambda h + o(h)$ , so

P_0(t+h) - P_0(t) = P_0(t)(-\lambda h + o(h)).

Step 2 — Differential equation for $P_0$ . Divide by $h$ and let $h\to 0$ :

P_0'(t) = -\lambda P_0(t).

With $P_0(0)=1$ this gives $P_0(t)=e^{-\lambda t}$ .

Step 3 — Recursion for $n\geq 1$ . Condition on events in $(t,t+h]$ . Using orderliness (at most one event in $h$ ):

P_n(t+h) = P_n(t)(1-\lambda h) + P_{n-1}(t)\lambda h + o(h).

Rearranging and taking $h\to 0$ :

P_n'(t) = -\lambda P_n(t) + \lambda P_{n-1}(t).

Step 4 — Solve the recursion. Multiply by the integrating factor $e^{\lambda t}$ :

\frac{d}{dt}\left[e^{\lambda t}P_n(t)\right] = \lambda e^{\lambda t}P_{n-1}(t).

Inductively, assuming $P_{n-1}(t)=e^{-\lambda t}(\lambda t)^{n-1}/(n-1)!$ , integration with $P_n(0)=0$ yields

e^{\lambda t}P_n(t) = \frac{(\lambda t)^n}{n!},

hence $P_n(t)=e^{-\lambda t}(\lambda t)^n/n!$ , which is [1]. $\blacksquare$

∎

ProofInter-arrival Times are Exponential

The first arrival exceeds $t$ iff no event occurred in $[0,t]$ :

P\{T_1 > t\} = P\{N(t)=0\} = e^{-\lambda t}.

Thus $T_1 \sim \text{Exponential}(\lambda)$ . For $T_2$ , condition on the first arrival at $s$ . By independent and stationary increments, the process restarts at time $s$ (the strong Markov / regeneration property), so the time to the next event has the same exponential law and is independent of $T_1$ . Inductively all $T_n$ are iid Exponential $(\lambda)$ . $\blacksquare$

∎

SD

Siméon Denis Poisson

1781–1840

Poisson was a French mathematician and physicist whose 1837 treatise Recherches sur la probabilité des jugements en matière criminelle et en matière civile introduced the distribution now bearing his name, as a limiting form of the binomial for rare events. Although he never studied the process (the temporal stochastic object), his distribution describing the count of rare events became its defining marginal law. Poisson also contributed Poisson's equation in potential theory, the Poisson bracket in mechanics, and Poisson's ratio in elasticity — a remarkable spread across pure and applied mathematics.

🧠 Intuition

Imagine standing under a light drizzle and counting raindrops hitting a small square of pavement. Drops fall independently; there's no "memory" — the chance of a hit in the next instant doesn't depend on how long you've waited. Over a fixed second, the average number of hits is constant. This is the Poisson process: the count over any time window is Poisson, and the gaps between drops are exponential. Two facts crystallize the picture:

Memorylessness: $P\{T > s+t \mid T > s\} = P\{T > t\}$ . Having waited 5 minutes for a bus with no arrival, your additional wait has the same distribution as a fresh start. The process never "ages."
Rate balance: the binomial $(n, \lambda t/n)$ converges to Poisson $(\lambda t)$ as $n\to\infty$ . Slice $[0,t]$ into $n$ tiny bins, each holding an event with probability $\lambda t/n$ ; infinitely many infinitely-rare trials give the Poisson law.

Figure

A Poisson process: arrival times

S_n

(gold dots) and the staircase count

N(t)

, with exponential gaps

T_n

.

ExampleCall Center Arrivals

Given: Calls arrive at a switchboard as a Poisson process with rate $\lambda = 3$ calls per minute.

(a) Probability that exactly 5 calls arrive in a 2-minute window. Mean $= \lambda t = 3 \times 2 = 6$ . By [1]:

P\{N(2)=5\} = e^{-6}\frac{6^5}{5!} = e^{-6}\frac{7776}{120} = e^{-6}(64.8) \approx 0.1606.

(b) Probability that no calls arrive in the next 40 seconds ( $= 2/3$ min). $\lambda t = 3 \times \tfrac{2}{3} = 2$ . So $P\{N=0\} = e^{-2} \approx 0.1353.$

(c) Expected waiting time until the next call: $E[T] = 1/\lambda = 1/3$ min $= 20$ seconds.

\boxed{P(a)\approx 0.161,\quad P(b)\approx 0.135,\quad E[T]\approx 20\text{ s}}

ExampleRadioactive Decay Detection

Given: A detector registers decay events from a sample at rate $\lambda = 0.5$ counts per second. Assume a Poisson process.

(a) Expected time for the 4th count: $E[S_4] = n/\lambda = 4/0.5 = 8$ s (from [4], mean of Gamma is $n/\lambda$ ).

(b) Variance of the time to the 4th count: $\text{Var}(S_4) = n/\lambda^2 = 4/0.25 = 16$ s², standard deviation $4$ s.

(c) Probability the 1st count takes longer than 3 s: $P\{S_1 > 3\} = e^{-\lambda \cdot 3} = e^{-1.5} \approx 0.2231.$

(d) Probability of exactly 2 counts in a 10-second window: $\lambda t = 5$ , so $P\{N(10)=2\} = e^{-5}\dfrac{5^2}{2!} = e^{-5}(12.5)\approx 0.0842.$

\boxed{E[S_4]=8\text{ s},\ \ \sigma_{S_4}=4\text{ s},\ \ P(S_1>3)\approx0.223,\ \ P(N{=}2)\approx0.084}

⚠️ Common mistake

"Stationary increments mean evenly spaced events." No. Stationarity means the distribution of counts depends only on interval length, not on where the interval sits. The actual events are highly irregular — clusters and long gaps are typical, not anomalies. People routinely mistake genuine Poisson randomness for "non-random" because real Poisson data looks clumpier than the false intuition of regular spacing.

⚠️ Common mistake

Confusing the rate $\lambda$ with a probability. $\lambda$ has units of events per unit time and can exceed 1. The quantity $\lambda h$ is only approximately a probability for small $h$ ; over a unit interval the probability of an event is $1-e^{-\lambda}$ , not $\lambda$ .

Counterexample

A process that fails orderliness. Suppose events arrive in pairs — every "trigger" deposits exactly two events simultaneously, with triggers forming a Poisson process. Then $P\{N(h)=2\} \not= o(h)$ (it is $\approx \lambda h$ ), violating axiom [2]. The count process is not Poisson; it is a compound Poisson process. Its variance exceeds its mean ( $\text{Var} = 4\lambda t > 2\lambda t = E[N]$ ), whereas a true Poisson process always has equal mean and variance, $\text{Var}(N(t)) = E[N(t)] = \lambda t$ .

connection

The Poisson process sits at a crossroads of probability:

It is a continuous-time Markov Chain (a pure birth process) — the simplest non-trivial example, with generator concentrated on $+1$ jumps.
Its inter-arrival times link it to the Exponential Distribution and, via sums, the Gamma Distribution.
It is the prototypical Lévy process: stationary, independent increments — the discrete-jump counterpart of Brownian Motion.
As a model of random points, it is the foundational example in the theory of point processes and spatial statistics.
The Poisson limit theorem connects it to the Binomial Distribution (rare-event limit) and underpins its derivation.

🔬 Where this appears

⏳ History

- 1711 — Abraham de Moivre studies rare-event approximations of binomial probabilities, foreshadowing the Poisson limit.

- 1837 — Siméon Denis Poisson publishes the Poisson distribution as a limit of the binomial in his work on judicial probabilities.

- 1898 — Ladislaus Bortkiewicz applies the distribution to rare events (famously, Prussian soldiers killed by horse kicks) in Das Gesetz der kleinen Zahlen.

- 1909 — Agner Krarup Erlang models telephone traffic as Poisson arrivals, founding queueing theory.

- 1903–1910 — Harald Cramér and Filip Lundberg develop collective risk theory using the Poisson claim process.

- 1910 — Ernest Rutherford and Hans Geiger empirically confirm Poisson statistics for alpha-particle emission.

- 1930s–40s — Andrey Kolmogorov and others formalize the Poisson process within the axiomatic theory of stochastic processes and Markov processes.

- 1955 — David Cox introduces doubly stochastic (Cox) processes, generalizing the Poisson process to random intensities.

- 1960s–70s — The general theory of point processes (Khinchin, Matthes, Mecke) places the Poisson process as the canonical "complete randomness" reference.

open-problem

Beyond the homogeneous case. Real-world arrival rates vary with time (traffic peaks, daily cycles). The inhomogeneous Poisson process replaces $\lambda$ with $\lambda(t)$ , so counts become Poisson with mean $\int_s^t \lambda(u)\,du$ . Estimating $\lambda(t)$ nonparametrically, and testing whether data are genuinely Poisson versus clustered (overdispersed) or regular (underdispersed), remain active in applied statistics. The Cox process lets $\lambda$ itself be random, capturing burstiness; distinguishing a Cox process from a pure inhomogeneous Poisson process from a single realization is notoriously hard. Higher-dimensional analogues (spatial and spatio-temporal Poisson processes) raise deep questions in stochastic geometry, including the behavior of Poisson–Voronoi tessellations and percolation on Poisson point clouds.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also