Waiting for the next event
A Poisson process counts how many events happen in a given interval. But flip the question: how long until the next event?
Buses arriving at a stop. Radioactive atoms decaying. Customers entering a shop. If the events follow a Poisson process, the waiting time between them follows a specific distribution.
Definition
A random variable has an Exponential distribution with rate if its PDF is: and for . We write .
The PDF starts at height and decays exponentially. Higher means faster decay — shorter waits are more likely.
The CDF has a clean closed form:
Adjust the rate and the query time . Switch between PDF and CDF views. Then toggle the memoryless property to see the core idea.
Key properties
If : The standard deviation equals the mean: .
The rate and the expected wait are reciprocals.
The memoryless property
The Geometric distribution was memoryless in discrete time. The Exponential is its continuous counterpart.
If , then for any :
Given that you've already waited minutes with no event, the remaining wait has the same distribution as if you just started. The past is irrelevant.
Proof
The process has no memory. If a lightbulb has an exponentially distributed lifetime and has been running for 1000 hours, the chance it lasts another 100 hours is the same as a brand-new bulb lasting 100 hours. Real lightbulbs age, but atoms don't.
See the memoryless property in action — pick how long you've already waited and watch the conditional survival curve land right on top of the original:
The curves overlap!
P(X > 3+2 | X > 3) = 0.4900 = P(X > 2) = 0.4900
The Exponential is the only continuous distribution with the memoryless property, just as the Geometric is the only discrete one.
Connection to Poisson
The Exponential and Poisson are two sides of the same coin:
| Poisson | Exponential |
|---|---|
| Counts events in fixed time | Measures time between events |
| Discrete (0, 1, 2, ...) | Continuous () |
| "How many in this interval?" | "How long until the next one?" |
If events arrive at rate per unit time:
- The count in units is
- The wait for the next event is
Applications
| Scenario | Rate | Mean wait |
|---|---|---|
| Server requests | 100/sec | 10 ms |
| Customer arrivals | 30/hour | 2 min |
| Radioactive decay | 0.01/year | 100 years |
| Machine failures | 0.5/month | 2 months |
Summary
| Property | Formula |
|---|---|
| , | |
| CDF | |
| Mean | |
| Variance | |
| Memoryless | |
| Poisson link | Expo wait ↔ Poisson count |
The Exponential distribution models waiting times in memoryless processes. Whenever events arrive randomly at a constant rate, the gaps between them are Exponential.
What's next
That covers the main continuous distributions. Coming up: deeper connections between distributions and tools for working with functions of random variables.