The Exponential Distribution

Stand at a bus stop. Sit by a phone in a call centre. Point a Geiger counter at a lump of uranium. In every case the same question hangs in the air: how long until the next thing happens? The next bus, the next call, the next click of a decaying atom. The exponential distribution is the answer — it is the distribution of the waiting time until the next event.

You've already met its partner. The Poisson distribution counts how many events land in a fixed window — 3 calls this minute, 7 cars this hour. The exponential asks the mirror-image question about the same stream of events: not "how many?" but "how long between them?". Poisson is the count; exponential is the wait. One is discrete (whole events), the other continuous (any positive length of time), and they are two faces of the very same random process — a Poisson process, in which events arrive independently at a steady average rate \lambda.

The formula, and what its pieces mean

If events arrive at rate \lambda (events per unit time), the waiting time X until the next one has probability density

f(x) = \lambda e^{-\lambda x}, \qquad x \ge 0.

Read it off the graph in your head: at x = 0 the density starts high, at \lambda, and then decays smoothly toward zero as the wait gets longer. Short waits are the most likely; long waits get rarer and rarer, but never quite impossible. That relentless downhill slide is the "exponential" in the name.

Two more expressions do most of the day-to-day work. The chance the wait is longer than some time x is the area in the tail,

P(X > x) = e^{-\lambda x},

and its complement, the cumulative distribution (the chance the event has already happened by time x), is

F(x) = P(X \le x) = 1 - e^{-\lambda x}.

The tail formula P(X > x) = e^{-\lambda x} is the one to keep in your pocket — it's the shortcut to almost every exponential question.

Mean and spread: the average wait is 1/\lambda

Here is the single most useful fact, and the one people most often get backwards. If events come at rate \lambda, the average time between them is

\mathbb{E}[X] = \frac{1}{\lambda}.

It's pure common sense once you say it aloud: if a shop serves \lambda = 2 customers per minute, the typical gap between customers is 1/2 a minute. Faster rate, shorter wait. The mean is the reciprocal of the rate — it is 1/\lambda, not \lambda.

The variance is the square of that mean,

\operatorname{Var}(X) = \frac{1}{\lambda^2}, \qquad \text{so the standard deviation is also } \frac{1}{\lambda}.

A standard deviation equal to the mean tells you the exponential is a very spread-out, lopsided distribution: a big pile of short waits near zero, dragged out by a long thin tail of occasional very long ones. Its long right tail makes the mean sit well to the right of the typical (most likely) value — nothing like the tidy symmetry of the normal curve.

Turn the rate up and down

Slide the rate \lambda and watch the whole story move. A bigger \lambda starts the curve higher and drops it away faster — events come thick and fast, so long waits become vanishingly unlikely. A smaller \lambda gives a low, slowly-fading curve — a sluggish stream where long waits are commonplace. The shaded region is the tail probability P(X > 1) = e^{-\lambda}: the chance you wait more than one time-unit for the next event. See how quickly it shrinks as \lambda grows.

Worked example 1 — waiting for a phone call

Calls reach a small help-desk as a Poisson process at \lambda = 2 calls per minute. You've just answered one. Two questions:

Worked example 2 — the wait that resets itself

Same help-desk, \lambda = 2 per minute — but now here's the twist that makes the exponential special. Suppose you've already been waiting 3 minutes and no call has come. What's the chance you wait at least one more minute?

Intuition screams "surely a call is overdue by now!" — but the maths says otherwise. We want the conditional probability

P(X > 3 + 1 \mid X > 3) = \frac{P(X > 4)}{P(X > 3)} = \frac{e^{-2\cdot 4}}{e^{-2\cdot 3}} = e^{-2(4-3)} = e^{-2} \approx 0.135.

That is exactly the same e^{-2} we'd get for a fresh, brand-new wait — the three minutes you already sat through changed nothing at all. The distribution has no memory of how long you've been waiting. Whatever the clock says, the next minute looks like the first minute. This is the memoryless property, and it's worth its own card.

The memoryless property

In symbols, for any already-elapsed wait s and any extra time t,

P(X > s + t \mid X > s) = P(X > t).

In words: given that you've waited s already, the remaining wait has the very same distribution as a fresh one. The process doesn't age. A component that hasn't failed yet is, statistically, as good as new — a brand-new atom and one that's sat undecayed for a billion years have identical chances of decaying in the next second.

Why does the exponential do this and nothing else? Because its tail is a pure power of e, and powers add when you multiply: e^{-\lambda(s+t)} = e^{-\lambda s}\, e^{-\lambda t}. Divide by e^{-\lambda s} and the elapsed time cancels clean away. In fact the exponential is the only continuous distribution with this property — it is the continuous cousin of the (also memoryless) geometric distribution.

It's the neatest link in all of elementary probability. Say events arrive at rate \lambda. The number in a window of length x is Poisson with mean \lambda x, so the chance of seeing zero events in that window is the Poisson formula with k = 0: e^{-\lambda x}.

But "no event before time x" is exactly the same statement as "the waiting time is longer than x." So P(X > x) = e^{-\lambda x} — and there is your exponential tail, popped straight out of the Poisson count. The gaps between Poisson events are exponentially distributed, with the identical \lambda. Count and wait, two views of one clock.

Three traps snare almost everyone meeting the exponential for the first time: