Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Exponential Distribution






Exponential Distribution: Waiting Time Until an Event Occurs


The exponential distribution models an experiment where events occur continuously and independently at a constant average rate, and the random variable measures the waiting time until the next event occurs. There are no discrete trials and no fixed endpoint; time flows continuously until the event happens. The defining feature of this experiment is that the probability of waiting longer depends only on the current moment, not on how much time has already passed.

Key Terms

Exponential Distribution— waiting time between events at constant rate λ\lambda
Poisson Distribution— counts events whose inter-arrival times are exponential
Expected Value— E[X]=1/λE[X] = 1/\lambda
Variance— Var⁡(X)=1/λ2\operatorname{Var}(X) = 1/\lambda^2
Probability Density Function— f(x)=λe−λxf(x) = \lambda e^{-\lambda x}

See All Probability Definitions →


The Probabilistic Experiment Behind exponential distribution


The probabilistic experiment behind the exponential distribution focuses on waiting time rather than counts or measurements. The experiment observes how long it takes until a particular event happens, under the assumption that the event occurs continuously and unpredictably, but at a steady average rate.

A defining characteristic of this experiment is lack of memory. The process does not "age": the chance that the event occurs in the next instant does not depend on how much time has already passed. Waiting longer provides no advantage or disadvantage—the system resets at every moment.

This framework applies when events occur independently, one at a time, and without buildup or anticipation. Time is continuous, and probability accumulates smoothly as time passes.

The exponential distribution captures the idea that short waiting times are common, while long waits are possible but become progressively more rare.

Example
Consider the time until the next phone call arrives at a quiet call center where calls come in at a stable average rate. Whether the last call arrived a second ago or an hour ago does not affect the likelihood of receiving the next one in the coming minute.

Exponential Distribution Notation

Notation

Exponential Distribution Notation

The exponential's marks answer three questions the letters alone cannot: whether the parameter in the parenthesis is a rate or a mean, how the density and the tail share one exponent, and how the no-memory identity looks with real-valued slots. All catalogued among the probability symbols.
The declaration tilde and capital/lowercase split come from random variable notation and distribution notation; ee and its exponentials from exponential function notation; the given-bar from conditional probability notation; FF and the survival contrast from CDF notation.
X∼Exp⁡(λ)X \sim \operatorname{Exp}(\lambda) vs Exp⁡(β)\operatorname{Exp}(\beta)
exponential with rate lambda — or with scale beta, its reciprocal
One slot, two rival readings: λ\lambda the rate (events per unit time — probability theory's usual choice) or β=1/λ\beta = 1/\lambda the scale, which is the mean wait itself; much statistical software parameterizes by scale. The mean is the fingerprint: E[X]=1/λE[X] = 1/\lambda under rate, E[X]=βE[X] = \beta under scale — if the declared parameter equals the average wait, you are reading the scale convention.
CasesThis λ\lambda is the Poisson's λ\lambda, unchanged: one process, two questions — count the events per window and the count is Pois⁡(λ)\operatorname{Pois}(\lambda), time the gap to the next and the wait is Exp⁡(λ)\operatorname{Exp}(\lambda); the letter crossing the discrete/continuous line is the notation's way of saying it is the same phenomenon.
Do not confuseIts own reciprocal. Feeding a rate into a scale slot (or back) turns a 10-minute average wait into a 6-per-hour rate misread as a 6-minute wait — the same silent-rescaling family as the normal's second slot, with a reciprocal instead of a square root.
f(x)=λe−λxf(x) = \lambda e^{-\lambda x}, P(X>x)=e−λxP(X > x) = e^{-\lambda x}
the density — and the survival tail, sharing one exponent
Two marks, one exponent: the density starts at height λ\lambda and decays by e−λxe^{-\lambda x}, and the tail probability is the bare exponential itself — the closed-form survival that makes this family the continuous twin of the geometric's qkq^k. Written S(x)S(x) where the survival function gets its own letter, it is 1−F(x)1 - F(x) in CDF terms.
CasesThe density's starting height IS the rate — so for λ>1\lambda > 1 the curve begins above 11, the flagship reminder that a density is not a probability; the support clause x≥0x \ge 0 rides the definition, waits being non-negative by nature.
Do not confuseEach other. f(x)f(x) and P(X>x)P(X > x) differ only by the leading λ\lambda — dropping or doubling it swaps a density for a probability mid-computation, and only the context (integrating vs evaluating) says which object is in hand.
P(X>s+t∣X>s)=P(X>t)P(X > s + t \mid X > s) = P(X > t)
having waited s already, the remaining wait behaves like a fresh start
The no-memory identity with real-valued slots — the continuous half of the pair whose discrete half lives at geometric notation. Among continuous distributions the exponential is the only one satisfying this line; Properties below walks the characterization.
CasesThe proof is the survival formula doing one division: e−λ(s+t)/e−λs=e−λte^{-\lambda(s+t)} / e^{-\lambda s} = e^{-\lambda t} — exponents subtracting is precisely what "no memory" looks like in algebra.
Do not confuseWear and ageing. Applying the identity to components that physically degrade reads the mark where its assumption fails — the formula describes waits driven by constant rates, and its very cleanness is the warning to check that the rate truly is constant.

Parameters


λ (lambda): rate parameter, where λ>0\lambda > 0

The exponential distribution is fully characterized by a single parameter.
λ represents the average rate at which events occur per unit time.
Alternatively, the distribution is sometimes parameterized by β=1/λ\beta = 1/\lambda, the scale parameter, which represents the mean waiting time.
Higher λ means events occur more frequently (shorter waiting times), while lower λ means events are more rare (longer waiting times).

Probability Density Function (PDF) and Support (Range)

Probability Density Function (PDF)


The probability density function (PDF) of an exponential distribution is given by:

Exponential PDF
f(x)={λe−λxif x≥00if x<0f(x) = \begin{cases} \lambda e^{-\lambda x} & \text{if } x \geq 0 \\ 0 & \text{if } x < 0 \end{cases}
Learn more about this formula: Exponential PDF →


Intuition Behind the Formula


Decreasing Density: The exponential distribution has its highest density at x = 0 and decreases exponentially as x increases. This reflects that shorter waiting times are more likely than longer ones.

Parameters:
• λ\lambda: The rate parameter controls how quickly the density decreases
• Higher λ\lambda means steeper decline (events happen more frequently)
• Lower λ\lambda means gentler decline (events happen less frequently)

Support (Range of the Random Variable):
• The random variable XX can take any non-negative value: [0,∞)[0, \infty)
• Time cannot be negative, so the support starts at zero
• Theoretically unbounded above, though very large values have low probability
• The support is the half-infinite interval [0,∞)[0, \infty)

Logic Behind the Formula:
• λ\lambda: The rate parameter also serves as the initial density at x = 0
• e−λxe^{-\lambda x}: Exponential decay function ensuring rapid decrease for larger x
• The decay rate is proportional to λ: faster decay for larger λ
• The total area under the curve equals 1:

Probability Density Function (PDF) and Support (Range)
∫0∞λe−λx dx=λ[−1λe−λx]0∞=1\int_{0}^{\infty} \lambda e^{-\lambda x}\,dx = \lambda \left[-\frac{1}{\lambda}e^{-\lambda x}\right]_{0}^{\infty} = 1

Practical Example: Customer service calls arrive at a help desk at an average rate of 5 per hour, so λ=5\lambda = 5. The time XX (in hours) until the next call follows Exp(5)\text{Exp}(5). The PDF is f(x)=5e−5xf(x) = 5e^{-5x} for x≥0x \geq 0. The probability of waiting less than 6 minutes (0.1 hours) is P(X≤0.1)=1−e−5(0.1)≈0.393P(X \leq 0.1) = 1 - e^{-5(0.1)} \approx 0.393, or about 39.3%.

Exponential Distribution

Time between events in a Poisson process

Explanation

The exponential distribution models the time between events in a Poisson process, where events occur continuously and independently at a constant average rate. The probability density function is f(x)=λe−λxf(x) = \lambda e^{-\lambda x} for x≥0x \geq 0, where λ\lambda is the rate parameter. The expected value is E[X]=1λE[X] = \frac{1}{\lambda} and the variance is Var(X)=1λ2\text{Var}(X) = \frac{1}{\lambda^2}. The exponential distribution has the memoryless property, meaning the probability of an event occurring in the next interval is independent of how much time has already passed. Common applications include time until equipment failure, waiting time between customer arrivals, radioactive decay, and time until the next earthquake.

0.000.200.400.600.801.0000.61.21.92.53.13.74.45.0xf(x)
Exponential density, lambda = 1

The density starts at height lambda at zero and decays geometrically: short waiting times are the most likely and long ones become rare at a constant relative rate. The area under the whole curve is 1 although the curve never touches the axis. Change lambda and watch the starting height and the decay trade off on the PDF visualizer.

Accumulating this density gives the CDF below.

Cumulative Distribution Function (CDF)


Cumulative Distribution Function (CDF)


The cumulative distribution function (CDF) gives the probability that XX is less than or equal to a specific value:

Exponential CDF
F(x)={0if x<01−e−λxif x≥0F(x) = \begin{cases} 0 & \text{if } x < 0 \\ 1 - e^{-\lambda x} & \text{if } x \geq 0 \end{cases}
Learn more about this formula: Exponential CDF →


Key Properties:
• F(0)=0F(0) = 0 (no probability mass below zero)
• F(x)→1F(x) \to 1 as x→∞x \to \infty (all probability is non-negative)
• The CDF increases from 0 to 1, starting slowly and approaching 1 asymptotically
• For any x≥0x \geq 0, P(X>x)=1−F(x)=e−λxP(X > x) = 1 - F(x) = e^{-\lambda x} (survival function)

Memoryless Property: The exponential distribution is the only continuous distribution with the memoryless property: P(X>s+t∣X>s)=P(X>t)P(X > s + t \mid X > s) = P(X > t). In terms of the CDF: knowing that X>sX > s doesn't change the probability that X>s+tX > s + t relative to waiting an additional time tt from the start.

Practical Use: The exponential CDF is one of the simplest to work with. To find P(X≤x)P(X \leq x) when X∼Exp(3)X \sim \text{Exp}(3) and x=2x = 2: F(2)=1−e−3(2)=1−e−6≈0.9975F(2) = 1 - e^{-3(2)} = 1 - e^{-6} \approx 0.9975, meaning about 99.75% of values fall below 2. The complementary probability P(X>2)=e−6≈0.0025P(X > 2) = e^{-6} \approx 0.0025.

Exponential Distribution CDF

Visualizing probability accumulation for exponential distribution

Exponential - CDF

Rapid initial rise, asymptotic approach to 1

CDF Explanation

The cumulative distribution function (CDF) of the exponential distribution is F(x)=1−e−λxF(x) = 1 - e^{-\lambda x} for x≥0x \geq 0, and F(x)=0F(x) = 0 for x<0x < 0. The CDF shows the probability that the waiting time is less than or equal to xx. The curve rises quickly at first and then asymptotically approaches 1. The memoryless property of the exponential distribution means that P(X>s+t∣X>s)=P(X>t)P(X > s + t | X > s) = P(X > t) for all s,t≥0s, t \geq 0. The median waiting time (where F(x)=0.5F(x) = 0.5) is ln⁡(2)λ\frac{\ln(2)}{\lambda}, and about 63.2% of events occur within the first 1λ\frac{1}{\lambda} time units.
0.00.20.40.60.81.000.61.21.92.53.13.74.45.0xF(x) = P(X ≤ x)
Exponential CDF, lambda = 1

The cumulative probability rises fastest at zero and flattens toward 1, mirroring the decaying density above it; F(x) is 1 minus e to the minus lambda x, so the median sits where the curve crosses one half. The gap between the curve and 1 is the survival probability that drives the memoryless property. Read the probability of waiting at most x on the continuous CDF visualizer.

The expected value follows from integrating this same density.

Expected Value (Mean)


Computing the mean of a continuous random variable involves integration rather than summation, weighting each point by its probability density. The continuous expected value framework applies directly to the exponential distribution:

Expected Value (Continuous)
E[X]=∫−∞∞x⋅f(x) dxE[X] = \int_{-\infty}^{\infty} x \cdot f(x) \, dx
Learn more about this formula: Expected Value (Continuous) →


Formula


Exponential Mean
E[X]=1λE[X] = \frac{1}{\lambda}
Learn more about this formula: Exponential Mean →


Where:
λ\lambda = the rate parameter (events per unit time)

Derivation and Intuition


The exponential distribution has PDF f(x)=λe−λxf(x) = \lambda e^{-\lambda x} for x≥0x \geq 0. Computing the expected value:

Expected Value (Mean)
E[X]=∫0∞x⋅λe−λx dxE[X] = \int_{0}^{\infty} x \cdot \lambda e^{-\lambda x} \, dx

Using integration by parts with u=xu = x and dv=λe−λxdxdv = \lambda e^{-\lambda x} dx:

Expected Value (Mean)
E[X]=[−xe−λx]0∞+∫0∞e−λx dxE[X] = \left[-x e^{-\lambda x}\right]_{0}^{\infty} + \int_{0}^{\infty} e^{-\lambda x} \, dx

The first term vanishes at both limits. For the second term:

Expected Value (Mean)
E[X]=∫0∞e−λx dx=[−1λe−λx]0∞=0−(−1λ)=1λE[X] = \int_{0}^{\infty} e^{-\lambda x} \, dx = \left[-\frac{1}{\lambda} e^{-\lambda x}\right]_{0}^{\infty} = 0 - \left(-\frac{1}{\lambda}\right) = \frac{1}{\lambda}

The result E[X]=1λE[X] = \frac{1}{\lambda} captures an intuitive relationship: if events occur at rate λ\lambda per unit time, then the average waiting time until the next event is 1λ\frac{1}{\lambda} time units. A higher rate means shorter average wait times; a lower rate means longer waits.

This parallels the geometric distribution, which models waiting in discrete trials. The exponential distribution is the continuous analog, modeling waiting in continuous time.

Example


Suppose customers arrive at a store at an average rate of λ=3\lambda = 3 customers per hour:

Expected Value (Mean)
E[X]=13 hours=20 minutesE[X] = \frac{1}{3} \text{ hours} = 20 \text{ minutes}

The expected time until the next customer arrives is 20 minutes. If the rate increases to λ=6\lambda = 6 customers per hour, the expected wait drops to 16\frac{1}{6} hours, or 10 minutes.

To compute the expected value of a exponential distribution for your own parameters, step by step, use the exponential expected value calculator.

Variance and Standard Deviation


The variance of a continuous random variable quantifies the spread of values around the mean. For continuous distributions, it is calculated through integration:

Variance and Standard Deviation
Var(X)=E[(X−μ)2]=∫−∞∞(x−μ)2f(x) dx\mathrm{Var}(X) = \mathbb{E}[(X - \mu)^2] = \int_{-\infty}^{\infty} (x - \mu)^2 f(x) \, dx

Alternatively, using the computational formula:

Variance and Standard Deviation
Var(X)=E[X2]−μ2\mathrm{Var}(X) = \mathbb{E}[X^2] - \mu^2

For the exponential distribution, this calculation reveals how the spread relates to the rate parameter.

Formula


Exponential Variance
Var(X)=1λ2\mathrm{Var}(X) = \frac{1}{\lambda^2}
Learn more about this formula: Exponential Variance →


Where:
λ\lambda = the rate parameter (events per unit time)

Derivation and Intuition


Starting with the computational formula, we need to calculate E[X2]\mathbb{E}[X^2].

We know from the expected value section that μ=1λ\mu = \frac{1}{\lambda}.

The exponential distribution has PDF f(x)=λe−λxf(x) = \lambda e^{-\lambda x} for x≥0x \geq 0:

Variance and Standard Deviation
E[X2]=∫0∞x2⋅λe−λx dx\mathbb{E}[X^2] = \int_{0}^{\infty} x^2 \cdot \lambda e^{-\lambda x} \, dx

Using integration by parts twice (or the gamma function), we obtain:

Variance and Standard Deviation
E[X2]=2λ2\mathbb{E}[X^2] = \frac{2}{\lambda^2}

Applying the computational formula:

Variance and Standard Deviation
Var(X)=2λ2−(1λ)2=2λ2−1λ2=1λ2\mathrm{Var}(X) = \frac{2}{\lambda^2} - \left(\frac{1}{\lambda}\right)^2 = \frac{2}{\lambda^2} - \frac{1}{\lambda^2} = \frac{1}{\lambda^2}

The result Var(X)=1λ2\mathrm{Var}(X) = \frac{1}{\lambda^2} shows that variance decreases rapidly as the rate increases. When events occur frequently (large λ\lambda), waiting times are consistently short with little variability. When events are rare (small λ\lambda), waiting times become both long and highly variable. The quadratic relationship means doubling the rate reduces variance by a factor of four.

Notably, for the exponential distribution, the standard deviation equals the mean—a unique property that doesn't hold for most distributions.

Standard Deviation


Variance and Standard Deviation
σ=1λ\sigma = \frac{1}{\lambda}

Example


Suppose customers arrive at a store at an average rate of λ=3\lambda = 3 customers per hour:

Variance and Standard Deviation
Var(X)=1(3)2=19 hours2≈0.111 hours2\mathrm{Var}(X) = \frac{1}{(3)^2} = \frac{1}{9} \text{ hours}^2 \approx 0.111 \text{ hours}^2

Variance and Standard Deviation
σ=13 hours=20 minutes\sigma = \frac{1}{3} \text{ hours} = 20 \text{ minutes}

The standard deviation of 20 minutes equals the mean waiting time of 20 minutes. This indicates substantial variability: sometimes the next customer arrives in just a few minutes, other times you might wait 40+ minutes, even though the average is 20 minutes.

Mode and Median

Mode


The mode is the value where the probability density function reaches its maximum—the peak of the distribution curve.

For the exponential distribution, the mode is always:

Mode and Median
Mode=0\text{Mode} = 0

Intuition: The exponential PDF is f(x)=λe−λxf(x) = \lambda e^{-\lambda x} for x≥0x \geq 0, which is a monotonically decreasing function. The density is highest at x=0x = 0 and decreases exponentially as xx increases.

At x=0x = 0: f(0)=λf(0) = \lambda

For any x>0x > 0: f(x)=λe−λx<λf(x) = \lambda e^{-\lambda x} < \lambda

The maximum always occurs at the left boundary of the support. This reflects the nature of waiting times—the shortest possible wait (zero) is always the most probable density value, though the probability of any exact value is zero (as with all continuous distributions).

Example
For customer arrivals with λ=3\lambda = 3 per hour:
Mode = 0
The density is highest at zero waiting time, then decays exponentially. While you can't actually wait exactly zero time, the probability density is concentrated near zero, making very short waits most likely.

Median


The median is the value mm such that P(X≤m)=0.5P(X \leq m) = 0.5—the point that divides the distribution's probability in half.

For the exponential distribution, the median can be found using the CDF F(x)=1−e−λxF(x) = 1 - e^{-\lambda x}:

Setting F(m)=0.5F(m) = 0.5:

Mode and Median
1−e−λm=0.51 - e^{-\lambda m} = 0.5

Mode and Median
e−λm=0.5e^{-\lambda m} = 0.5

Mode and Median
−λm=ln⁡(0.5)=−ln⁡(2)-\lambda m = \ln(0.5) = -\ln(2)

Mode and Median
m=ln⁡(2)λm = \frac{\ln(2)}{\lambda}

The median is:

Mode and Median
Median=ln⁡(2)λ≈0.693λ\text{Median} = \frac{\ln(2)}{\lambda} \approx \frac{0.693}{\lambda}

Example:
For customer arrivals with λ=3\lambda = 3 per hour:

Mode and Median
Median=ln⁡(2)3≈0.6933≈0.231 hours≈13.9 minutes\text{Median} = \frac{\ln(2)}{3} \approx \frac{0.693}{3} \approx 0.231 \text{ hours} \approx 13.9 \text{ minutes}

Half of the waiting times are less than 13.9 minutes, and half are greater.

Properties:
• The exponential distribution is right-skewed: mode < median < mean
• Mode = 0, Median = ln⁡(2)λ≈0.693×1λ\frac{\ln(2)}{\lambda} \approx 0.693 \times \frac{1}{\lambda}, Mean = 1λ\frac{1}{\lambda}
• The median is always smaller than the mean: about 69.3% of the mean value
• This reflects the right skew—most observations cluster near zero, but occasional long waits pull the mean higher
• The relationship Median/Mean ≈ 0.693 holds for all exponential distributions regardless of λ\lambda
Exponential density with rate 1: mode 0, median ln 2 = 0.693, mean 1, in that order from left to rightxy121medianmeanf(x) = e^(−x)mode 0mode 0 < median 0.693 < mean 1half the area lies left of 0.693λ = 1: the long right tail pulls the mean past the median
Mode, median and mean of Exp(1)

The density e^(−x) for rate λ = 1. Its highest point is at 0, the mode. The median, ln 2 ≈ 0.693, is the dashed line with half of the area on each side. The mean, 1, lies further right: the long thin tail carries little area but large values, and they pull the average past the median. For any rate the three keep this order and the ratios: median = 0.693 × mean.

With λ = 3 per hour all three scale by 1/3: mode 0, median 13.9 minutes, mean 20 minutes.

Quantiles/Percentiles


A quantile is a value that divides the distribution at a specific probability threshold. The pp-th quantile xpx_p satisfies:

Quantiles/Percentiles
P(X≤xp)=pP(X \leq x_p) = p

where 0<p<10 < p < 1.

Percentiles are quantiles expressed as percentages: the kk-th percentile corresponds to the quantile at p=k/100p = k/100. For example, the 25th percentile is the 0.25 quantile, the 50th percentile is the median, and the 75th percentile is the 0.75 quantile.

Quantiles are found by inverting the CDF: if F(xp)=pF(x_p) = p, then xp=F−1(p)x_p = F^{-1}(p).

Finding Quantiles for the Exponential Distribution


For an exponential distribution with rate parameter λ\lambda, the CDF is:

Quantiles/Percentiles
F(x)=1−e−λxF(x) = 1 - e^{-\lambda x}

To find the pp-th quantile, we solve F(xp)=pF(x_p) = p:

Quantiles/Percentiles
1−e−λxp=p1 - e^{-\lambda x_p} = p

Quantiles/Percentiles
e−λxp=1−pe^{-\lambda x_p} = 1 - p

Quantiles/Percentiles
−λxp=ln⁡(1−p)-\lambda x_p = \ln(1 - p)

Quantiles/Percentiles
xp=−ln⁡(1−p)λ=−ln⁡(1−p)λx_p = -\frac{\ln(1 - p)}{\lambda} = \frac{-\ln(1 - p)}{\lambda}

This gives the general quantile formula:

Quantiles/Percentiles
xp=−ln⁡(1−p)λx_p = \frac{-\ln(1 - p)}{\lambda}

Unlike the normal distribution, the exponential distribution has a closed-form expression for quantiles—no tables or numerical methods needed.

Common Percentiles


25th Percentile (First Quartile, Q1):

Quantiles/Percentiles
x0.25=−ln⁡(1−0.25)λ=−ln⁡(0.75)λ=0.288λx_{0.25} = \frac{-\ln(1 - 0.25)}{\lambda} = \frac{-\ln(0.75)}{\lambda} = \frac{0.288}{\lambda}

About 25% of waiting times are less than 0.288λ\frac{0.288}{\lambda}.

50th Percentile (Median, Q2):

Quantiles/Percentiles
x0.50=−ln⁡(1−0.50)λ=−ln⁡(0.50)λ=ln⁡(2)λ≈0.693λx_{0.50} = \frac{-\ln(1 - 0.50)}{\lambda} = \frac{-\ln(0.50)}{\lambda} = \frac{\ln(2)}{\lambda} \approx \frac{0.693}{\lambda}

This matches the median derived earlier.

75th Percentile (Third Quartile, Q3):

Quantiles/Percentiles
x0.75=−ln⁡(1−0.75)λ=−ln⁡(0.25)λ=1.386λx_{0.75} = \frac{-\ln(1 - 0.75)}{\lambda} = \frac{-\ln(0.25)}{\lambda} = \frac{1.386}{\lambda}

About 75% of waiting times are less than 1.386λ\frac{1.386}{\lambda}.

Interquartile Range (IQR):

Quantiles/Percentiles
IQR=Q3−Q1=1.386λ−0.288λ=1.098λ\text{IQR} = Q3 - Q1 = \frac{1.386}{\lambda} - \frac{0.288}{\lambda} = \frac{1.098}{\lambda}

The IQR contains the middle 50% of the distribution.

Example


For customer arrivals with λ=3\lambda = 3 per hour:

25th percentile: 0.2883=0.096\frac{0.288}{3} = 0.096 hours ≈5.8\approx 5.8 minutes

25% of waits are less than 5.8 minutes.

50th percentile: 0.6933=0.231\frac{0.693}{3} = 0.231 hours ≈13.9\approx 13.9 minutes

Half of waits are less than 13.9 minutes (the median).

75th percentile: 1.3863=0.462\frac{1.386}{3} = 0.462 hours ≈27.7\approx 27.7 minutes

75% of waits are less than 27.7 minutes.

IQR: 1.0983=0.366\frac{1.098}{3} = 0.366 hours ≈22\approx 22 minutes

The middle 50% of waiting times span about 22 minutes.

Other Notable Percentiles


90th percentile: x0.90=−ln⁡(0.10)λ=2.303λx_{0.90} = \frac{-\ln(0.10)}{\lambda} = \frac{2.303}{\lambda} (only 10% of waits exceed this)

95th percentile: x0.95=−ln⁡(0.05)λ=2.996λx_{0.95} = \frac{-\ln(0.05)}{\lambda} = \frac{2.996}{\lambda} (only 5% of waits exceed this)

99th percentile: x0.99=−ln⁡(0.01)λ=4.605λx_{0.99} = \frac{-\ln(0.01)}{\lambda} = \frac{4.605}{\lambda} (only 1% of waits exceed this)

The exponential distribution's right skew means that while most observations cluster near zero, the upper percentiles can be quite large relative to the mean 1λ\frac{1}{\lambda}.

Real-World Examples and Common Applications


The exponential distribution models waiting times and lifetimes when events occur randomly and independently at a constant rate.

Common Applications


Reliability Engineering and Survival Analysis:
• Component failure times (electronics, mechanical parts)
• System reliability modeling
• Time until equipment breakdown
• Light bulb lifetimes

Queueing Theory and Service Systems:
• Time between customer arrivals
• Call center inter-arrival times
• Web server request intervals
• Traffic flow patterns

Physics and Natural Sciences:
• Radioactive decay intervals
• Time between cosmic ray detections
• Molecular collision intervals
• Photon emission times

Insurance and Actuarial Science:
• Time until next insurance claim
• Inter-occurrence times for accidents
• Time between policy cancellations

Why It Appears


The exponential distribution is the continuous analog of the geometric distribution. It emerges naturally from Poisson processes—when events follow a Poisson process with rate λ\lambda, the time until the next event follows an exponential distribution with the same rate parameter.

The memoryless property makes it unique: P(X>s+t∣X>s)=P(X>t)P(X > s + t \mid X > s) = P(X > t). Past waiting time provides no information about future waiting time.

Example Application


A web server receives requests at an average rate of 120 per hour (λ=2\lambda = 2 per minute). The time between consecutive requests follows Exp(2)\text{Exp}(2).

The median wait between requests is ln⁡(2)2≈0.35\frac{\ln(2)}{2} \approx 0.35 minutes (21 seconds). However, 10% of inter-arrival times exceed 2.32=1.15\frac{2.3}{2} = 1.15 minutes, requiring server capacity planning for occasional gaps.

Interactive Calculator

Exponential Distribution Calculator

Calculate probabilities and distribution properties

Average rate of occurrence


Special Cases


The exponential distribution has several special cases and limiting behaviors that reveal its connections to other distributions and its unique mathematical properties.

Unit Exponential Distribution


When λ=1\lambda = 1, we obtain the unit exponential distribution Exp(1)\text{Exp}(1):

Special Cases
f(x)=e−x for x≥0f(x) = e^{-x} \text{ for } x \geq 0

This simplified form is often used in theoretical work. Any exponential random variable X∼Exp(λ)X \sim \text{Exp}(\lambda) can be transformed to unit exponential:

Special Cases
Y=λX∼Exp(1)Y = \lambda X \sim \text{Exp}(1)

As λ → 0 (Rate Decreases)


As λ→0\lambda \to 0, events become increasingly rare:

• The mean 1λ→∞\frac{1}{\lambda} \to \infty (average wait grows without bound)
• The distribution becomes more spread out
• Most probability mass shifts toward larger values
• The density near zero approaches zero

This represents the limit of extremely infrequent events.

As λ → ∞ (Rate Increases)


As λ→∞\lambda \to \infty, events occur nearly instantaneously:

• The mean 1λ→0\frac{1}{\lambda} \to 0 (average wait shrinks to zero)
• All probability concentrates near zero
• The distribution degenerates toward a point mass at zero

This represents the limit where waiting time becomes negligible.

Limiting Behavior and Connections


Relationship to Poisson:
The exponential distribution is intimately connected to the Poisson distribution. If events follow a Poisson process with rate λ\lambda, then:

• The time until the first event is Exp(λ)\text{Exp}(\lambda)
• The time between consecutive events is Exp(λ)\text{Exp}(\lambda)

The exponential is the continuous-time analog of the geometric distribution.

Minimum of Exponentials:
If X1∼Exp(λ1)X_1 \sim \text{Exp}(\lambda_1) and X2∼Exp(λ2)X_2 \sim \text{Exp}(\lambda_2) are independent, then:

Special Cases
min⁡(X1,X2)∼Exp(λ1+λ2)\min(X_1, X_2) \sim \text{Exp}(\lambda_1 + \lambda_2)

The minimum waiting time has rate equal to the sum of rates. This property is crucial in reliability theory (system fails when first component fails).

Memoryless Property:
The exponential distribution is the only continuous distribution with the memoryless property:

Exponential Memoryless
P(X>s+t∣X>s)=P(X>t)P(X > s + t \mid X > s) = P(X > t)
Learn more about this formula: Exponential Memoryless →


This makes it the natural choice for modeling random failures and arrivals.

Practical Implications


Reliability Analysis:
When λ\lambda is very small (reliable components), failures are rare and the exponential model applies over long time spans. As λ\lambda increases (less reliable components), the model still applies but predicts more frequent failures.

Queueing Systems:
In service systems, when λ\lambda is large (high arrival rate), the system stays busy. As λ\lambda decreases (low traffic), the server experiences longer idle periods between customers.

Properties


The exponential distribution has several distinctive properties, most notably the memoryless property that uniquely characterizes it among continuous distributions.

Symmetry


The exponential distribution is not symmetric. It has:
• Support on [0,∞)[0, \infty) only
• Maximum density at x=0x = 0
• Long right tail extending to infinity
• Strong positive skew

Skewness


Properties
Skewness=2\text{Skewness} = 2

The skewness coefficient of 2 indicates substantial right skew. Most probability mass concentrates near zero, but the long tail pulls the mean rightward.

Kurtosis


Properties
Kurtosis=9\text{Kurtosis} = 9

Properties
Excess Kurtosis=6\text{Excess Kurtosis} = 6

High kurtosis (9 versus 3 for normal) indicates the exponential distribution has heavier tails than the normal distribution. Extreme values occur more frequently than in normal or uniform distributions.

Tail Behavior


The exponential distribution has exponentially decaying right tail:

Properties
f(x)=λe−λx→0 as x→∞f(x) = \lambda e^{-\lambda x} \to 0 \text{ as } x \to \infty

The tail decreases exponentially, which is:
• Heavier than normal tails (which decay like e−x2e^{-x^2})
• Lighter than polynomial tails (like power laws)
• Characteristic of many natural decay processes

Probabilities in the tail:
• P(X>2λ)=e−2≈0.135P(X > \frac{2}{\lambda}) = e^{-2} \approx 0.135 (13.5%)
• P(X>3λ)=e−3≈0.050P(X > \frac{3}{\lambda}) = e^{-3} \approx 0.050 (5%)
• P(X>5λ)=e−5≈0.007P(X > \frac{5}{\lambda}) = e^{-5} \approx 0.007 (0.7%)

Unique Mathematical Properties


Memoryless Property (Defining Characteristic):
Exponential Memoryless
P(X>s+t∣X>s)=P(X>t) for all s,t≥0P(X > s + t \mid X > s) = P(X > t) \text{ for all } s, t \geq 0
Learn more about this formula: Exponential Memoryless →


The exponential is the only continuous distribution with this property. Past waiting time provides no information about future waiting time. This makes it ideal for modeling random arrivals and failures without aging effects.

Equivalently:
Properties
P(X>s+t)=P(X>s)⋅P(X>t)P(X > s + t) = P(X > s) \cdot P(X > t)

Constant Hazard Rate:
The hazard function (instantaneous failure rate) is constant:

Properties
h(x)=f(x)1−F(x)=λe−λxe−λx=λh(x) = \frac{f(x)}{1 - F(x)} = \frac{\lambda e^{-\lambda x}}{e^{-\lambda x}} = \lambda

The failure rate doesn't depend on age—components don't "wear out" under the exponential model.

Closure Under Minimum:
If X1∼Exp(λ1)X_1 \sim \text{Exp}(\lambda_1) and X2∼Exp(λ2)X_2 \sim \text{Exp}(\lambda_2) are independent:

Properties
min⁡(X1,X2)∼Exp(λ1+λ2)\min(X_1, X_2) \sim \text{Exp}(\lambda_1 + \lambda_2)

The minimum of exponentials is exponential with rate equal to the sum of rates.

Scaling Property:
If X∼Exp(λ)X \sim \text{Exp}(\lambda), then for any c>0c > 0:

Properties
cX∼Exp(λ/c)cX \sim \text{Exp}(\lambda/c)

Rescaling by cc divides the rate by cc.

Useful Identities


Relationship to Poisson:
If events follow a Poisson process with rate λ\lambda, the time between events is Exp(λ)\text{Exp}(\lambda). The number of events in time tt is Poisson(λt)\text{Poisson}(\lambda t).

Mean Equals Standard Deviation:
Properties
E[X]=σ=1λE[X] = \sigma = \frac{1}{\lambda}

This unique relationship (mean = standard deviation) holds only for the exponential distribution.

Lack of Memory Formula:
Properties
E[X−t∣X>t]=E[X]=1λE[X - t \mid X > t] = E[X] = \frac{1}{\lambda}

The expected remaining waiting time equals the original expected waiting time—knowing you've already waited tt time units doesn't change your expectation.

Survival Function:
Properties
S(x)=P(X>x)=e−λxS(x) = P(X > x) = e^{-\lambda x}

Simple exponential decay makes many calculations tractable.

Sum of Exponentials:
The sum of nn independent Exp(λ)\text{Exp}(\lambda) variables follows a Gamma(n,λ)(n, \lambda) distribution, generalizing the exponential.
Exponential density with rate 1 and the density of X given X > 1: the same curve, moved to start at 1xy123451s = 1f(x) = e^(−x)given X > 1: e^(−(x−1))same shape, just shifted:the wait so far is forgottenMemoryless: after waiting 1, the remaining wait is Exp(1) again
The memoryless property as a picture

The blue curve is the Exp(1) density. The amber curve is the density of X once we know X > 1: it starts at x = 1 with height 1 and decays exactly like the original. It is the same curve moved one unit to the right, so the remaining wait X − 1 again follows Exp(1). Having waited already tells nothing about how much longer the wait will be.

Any other density would change shape after conditioning; this is why the exponential is the only memoryless one.

Related Distributions


Exponential Distribution at a Glance

The table below collects the full anatomy of the exponential distribution into a single reference card — its rate parameter, support, PDF and CDF (both closed-form), the mean and variance, mode and median, the closed-form quantile function, the defining memoryless property with constant hazard rate, the connection to the Poisson process, and a canonical customer-arrivals example.
Aspect Formula / statement Note / example
Parameter λ > 0 — rate (events per unit time) scale form: β = 1/λ (the mean waiting time)
Support x ∈ [0, ∞) waiting times are non-negative
PDF f(x) = λ · e−λx on x ≥ 0; 0 elsewhere monotonically decreasing; maximum density at x = 0
CDF F(x) = 1 − e−λx on x ≥ 0; survival S(x) = e−λx closed form — no tables needed (unlike normal)
Expected value E[X] = 1 / λ reciprocal of the rate
Variance Var(X) = 1 / λ2; σ = 1 / λ = E[X] unique to exponential: standard deviation equals the mean
Mode and median mode = 0; median = ln(2) / λ ≈ 0.693 / λ right-skewed: mode < median < mean
Quantile function xp = −ln(1 − p) / λ closed-form inverse CDF — straightforward to sample
Memoryless property P(X > s + t | X > s) = P(X > t); hazard rate h(x) = λ is constant the only continuous distribution with this property; no aging
Poisson connection events at rate λ → inter-arrival times ~ Exp(λ) continuous-time analog of the geometric distribution
Canonical example customer arrivals at λ = 3 per hour E[X] = 20 min, median ≈ 13.9 min, σ = 20 min

Exponential Distribution FAQ

Is the exponential parameter a rate or a mean?

+
Both conventions exist. Exp(λ) usually means the rate — events per unit time — giving E[X] = 1/λ. Exp(β) means the scale, β being the mean wait itself, so E[X] = β. Much statistical software uses scale while probability texts use rate. The mean is the fingerprint: if the declared parameter equals the average wait, you are reading scale.Read more →

What is the relationship between the exponential and Poisson distributions?

+
They describe one process from two angles. If events arrive as a Poisson process with rate λ, then the count in a fixed window is Pois(λ) and the gap between consecutive events is Exp(λ) — the same λ, unchanged. Count the events or time the wait: same phenomenon, different question.Read more →

Does memorylessness mean a used component is as good as new?

+
Under an exponential model, yes — and that is the warning, not the reassurance. The identity says a component that has run for s hours has the same remaining-life distribution as a fresh one. Real parts that wear out do not behave that way, so the model's cleanness is a prompt to check the failure rate genuinely is constant.Read more →

What is the difference between the exponential density and its tail probability?

+
A single factor of λ. The density is f(x) = λe^(−λx); the survival probability is P(X > x) = e^(−λx), the bare exponential. Dropping or doubling that leading λ swaps a density for a probability mid-computation, and nothing in the expression flags it — only whether you are integrating or evaluating says which object you hold.Read more →