The Exponential Distribution, Explained
After reading this you can compute the chance that a wait lasts longer or shorter than some time, find the time that a fixed percentage of waits fall under, and tell when the exponential model fits and when it does not.
What it models and one quick example
The exponential distribution describes the waiting time until the next event in a process where events happen at a steady average rate and each event is independent of the last. That kind of process is called a Poisson process. If events arrive at rate \lambda per unit time, the gap between consecutive events follows an exponential distribution with that same \lambda.
Suppose a help desk gets 2 calls per minute on average. Set \lambda = 2. How likely is it that the next call arrives within 1 minute? The answer is 0.8647, computed below. Only about 13.5% of the time will you wait longer than a full minute.
The single parameter \lambda controls everything. Its reciprocal 1/\lambda is the mean waiting time. At \lambda = 2 per minute the average gap is 0.5 minutes, or 30 seconds.
When to use it, and when not to
Use the exponential distribution when you are timing the wait until one event and the following assumptions hold:
- Events occur at a constant average rate over the window you care about.
- Events are independent: one arrival does not make the next more or less likely.
- You are measuring a continuous, positive quantity (time, distance, or volume until an event).
Do not use it when the rate changes over time, for example call volume that peaks at lunch. Do not use it when the risk of an event depends on how long you have already waited. A machine part that wears out has a rising failure rate with age, so the exponential model understates late failures. For that, reach for the Weibull calculator. If you are counting how many events happen in a fixed interval rather than timing the wait, use the Poisson calculator. The two are linked: exponential waits and Poisson counts describe the same underlying process from different angles.
The exponential distribution is memoryless. If you have already waited 3 minutes with no call, the chance of waiting at least 1 more minute is exactly the same as it was at the start: 0.1353 when \lambda = 2. If your real process "remembers" its age, this is the wrong model.
The formula and the intuition behind it
The probability density function (PDF) gives the relative likelihood at a single point x:
Here \lambda is the rate (events per unit) and x is the waiting time. The density starts at its highest value \lambda when x = 0 and decays toward zero. Short waits are always more likely than long ones.
For actual probabilities you want the cumulative distribution function (CDF), the chance the wait is at most x:
The tail probability, the chance of waiting longer than x, is the complement:
To go the other way and find the time x that a proportion p of waits fall under, invert the CDF. This is the quantile function:
Every symbol here is one you already have: \ln is the natural logarithm, p is the cumulative probability between 0 and 1, and \lambda is the rate. The mean is 1/\lambda and the standard deviation is also 1/\lambda, so this distribution is as spread out as its own average.
Reproducing the demo: lambda = 2, x = 1
The calculator's default is probability mode with \lambda = 2 and x = 1. Here is every step.
- Multiply: \lambda x = 2 \times 1 = 2.
- Exponentiate the negative: e^{-2} = 0.1353.
- Density at x = 1: f(1) = 2 \times 0.1353 = 0.2707.
- Cumulative probability: F(1) = 1 - 0.1353 = 0.8647.
- Tail probability: P(X \gt 1) = 0.1353.
So with 2 calls per minute on average, there is an 86.47% chance the next call comes within a minute and a 13.53% chance you wait longer.
Going backward: the 95th percentile
Switch to critical mode with \lambda = 2 and p = 0.95. This asks: 95% of waits are shorter than what time?
- Compute 1 - p = 1 - 0.95 = 0.05.
- Take the natural log: \ln(0.05) = -2.996.
- Divide by -\lambda: x = -(-2.996)/2 = 1.498.
About 1.498 minutes. Only 5% of gaps between calls last longer than roughly 90 seconds.
Reading and interpreting the results
Keep three outputs straight. The density f(x) is not a probability; it can exceed 1, as it does at x = 0 when \lambda = 2 (there f(0) = 2). It measures how concentrated probability is near a point. Only areas under the curve are probabilities.
The CDF F(x) answers "at most" questions and always sits between 0 and 1. The tail e^{-\lambda x} answers "more than" questions. They add to 1.
| x (minutes) | f(x) | F(x) = P(X ≤ x) | P(X > x) |
|---|---|---|---|
| 0.25 | 1.213 | 0.3935 | 0.6065 |
| 0.5 | 0.7358 | 0.6321 | 0.3679 |
| 1 | 0.2707 | 0.8647 | 0.1353 |
| 1.5 | 0.0996 | 0.9502 | 0.0498 |
| 2 | 0.0366 | 0.9817 | 0.0183 |
Notice the mean wait of 0.5 minutes falls at F(0.5) = 0.6321, not at 0.5. Because the distribution is right-skewed, the mean sits above the median. The median is where F(x) = 0.5, namely \ln(2)/\lambda = 0.3466 minutes.
Common mistakes
Confusing the rate with the mean. If a source says "average time between failures is 5 hours," the mean is 5, so \lambda = 1/5 = 0.2 per hour. Plugging 5 in as the rate gives wildly wrong answers. The chance of failure within 1 hour is 1 - e^{-0.2} = 0.1813, not 1 - e^{-5} = 0.9933.
Mixing up time units. The rate and the value x must use the same unit. If \lambda = 2 per minute and you want the chance of a wait under 30 seconds, use x = 0.5 minutes, not 30.
Treating density as probability. A density of 0.2707 at x = 1 is not a 27% chance of the wait equaling 1 minute. For a continuous distribution the probability of any exact value is zero. You need an interval.
To get the probability of a wait between two times a and b, subtract two CDF values: F(b) - F(a). Between 0.5 and 1 minute at \lambda = 2 that is 0.8647 - 0.6321 = 0.2326.
Related distributions and calculators
The exponential distribution is a special case of the gamma distribution with shape parameter 1. Sum k independent exponential waits and you get a gamma (Erlang) distribution for the time until the k-th event. Its discrete cousin is the geometric distribution, which counts trials to the first success and is also memoryless.
For counts rather than waits, use the Poisson calculator. For failure times where risk changes with age, the Weibull calculator generalizes the exponential. For a flat waiting time over a fixed range, see the uniform calculator. And for bell-shaped continuous data, the normal calculator is the standard starting point.
Frequently asked questions
What does the rate lambda actually mean?
It is the average number of events per unit of time (or distance, or volume). If buses arrive at \lambda = 0.1 per minute, that is one bus every 10 minutes on average, since the mean wait is 1/\lambda = 10.
Why do the mean and standard deviation come out equal?
Both equal 1/\lambda. This is a fixed property of the exponential distribution: the spread is always as large as the average. At \lambda = 2 both are 0.5. It signals a highly variable wait, not a tightly clustered one.
What does "memoryless" mean in practice?
The probability of waiting at least t more units does not depend on how long you have already waited. Having waited 3 minutes for a call gives you no better or worse odds for the next minute than starting fresh. Real aging processes violate this, which is why worn parts need Weibull instead.
Can x or lambda be zero or negative?
The rate \lambda must be strictly positive. The value x must be zero or positive; the distribution has no support below zero, so F(x) = 0 for any negative x.
How is this connected to the Poisson distribution?
They describe the same process. If events per unit time follow a Poisson distribution with mean \lambda, then the gaps between events follow an exponential distribution with rate \lambda. Counting and timing are two views of one Poisson process.