Skip to content
Part IA Easter Term

Exponential Distribution

Motivation

The exponential distribution models the time until an event occurs when events happen:

  • Continuously over time
  • At a constant average rate
  • Independently of past history

Examples:

  • Time until radioactive decay
  • Time until customer arrives
  • Lifetime of a component
  • Time between earthquakes (if Poisson process)

Definition

X∼Exp(λ)X \sim \text{Exp}(\lambda) has PDF:

f(x)=λe−λx,x≥0f(x) = \lambda e^{-\lambda x}, \quad x \geq 0

where λ>0\lambda > 0 is the rate parameter.

Range

X∈[0,∞)X \in [0, \infty)

CDF

F(x)=1−e−λx,x≥0F(x) = 1 - e^{-\lambda x}, \quad x \geq 0

Survival Function

P(X>x)=e−λxP(X > x) = e^{-\lambda x}

Expectation and Variance

E[X]=1λE[X] = \frac{1}{\lambda}

Interpretation: If events occur at rate λ\lambda per unit time, average wait time is 1/λ1/\lambda.

Var(X)=1λ2\text{Var}(X) = \frac{1}{\lambda^2}

σX=1λ=E[X]\sigma_X = \frac{1}{\lambda} = E[X]

For exponential, mean equals standard deviation.

Memoryless Property

The exponential is the only continuous memoryless distribution:

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

Interpretation: If a component has survived ss time units, its remaining lifetime distribution is the same as a new component.

Proof

P(X>s+t∣X>s)=P(X>s+t)P(X>s)=e−λ(s+t)e−λs=e−λt=P(X>t)P(X > s + t \mid X > s) = \frac{P(X > s + t)}{P(X > s)} = \frac{e^{-\lambda(s+t)}}{e^{-\lambda s}} = e^{-\lambda t} = P(X > t)

Practical Meaning

A lightbulb with exponential lifetime has no “aging.” A 10-year-old bulb (that still works) is as good as new. This is reasonable for some random failures but not for wear-out failures.

Quantiles

For X∼Exp(λ)X \sim \text{Exp}(\lambda):

P(X≤xp)=1−e−λxp=pP(X \leq x_p) = 1 - e^{-\lambda x_p} = p

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

Median:

x0.5=ln⁡2λ≈0.693λx_{0.5} = \frac{\ln 2}{\lambda} \approx \frac{0.693}{\lambda}

Note: median << mean since the distribution is right-skewed.

Relation to Poisson

If events occur as a Poisson process with rate λ\lambda:

  • Number of events in time tt ~ Poisson(λt)\text{Poisson}(\lambda t)
  • Time until first event ~ Exp(λ)\text{Exp}(\lambda)
  • Time until kkth event ~ Gamma(k,λ)\text{Gamma}(k, \lambda)

Example

Customers arrive at rate 2 per minute. Time until first customer:

X∼Exp(λ=2)X \sim \text{Exp}(\lambda = 2)

E[X]=12=0.5 minutesE[X] = \frac{1}{2} = 0.5 \text{ minutes}

P(X>1)=e−2⋅1=e−2≈0.135P(X > 1) = e^{-2 \cdot 1} = e^{-2} \approx 0.135

Minimum of Exponentials

If X1,…,XnX_1, \ldots, X_n are independent with Xi∼Exp(λi)X_i \sim \text{Exp}(\lambda_i), then:

min⁡(X1,…,Xn)∼Exp(∑i=1nλi)\min(X_1, \ldots, X_n) \sim \text{Exp}\left(\sum_{i=1}^n \lambda_i\right)

Intuition: If nn independent processes are running, and we wait for the first to “fire,” the minimum follows exponential with combined rate.

Example: Competing Risks

A system has two failure modes, with failure rates λ1=0.01\lambda_1 = 0.01/hour and λ2=0.02\lambda_2 = 0.02/hour. Time to failure:

min⁡(X1,X2)∼Exp(0.03)\min(X_1, X_2) \sim \text{Exp}(0.03)

E[failure time]=10.03≈33.3 hoursE[\text{failure time}] = \frac{1}{0.03} \approx 33.3 \text{ hours}

Visualisation

The exponential PDF starts at λ\lambda and decays toward 0. It is always decreasing (no mode except at 0).

Exponential PDFs for different lambdas

Summary

PropertyValue
PDFf(x)=λe−λxf(x) = \lambda e^{-\lambda x}, x≥0x \geq 0
CDFF(x)=1−e−λxF(x) = 1 - e^{-\lambda x}
Mean1λ\frac{1}{\lambda}
Variance1λ2\frac{1}{\lambda^2}
Medianln⁡2λ\frac{\ln 2}{\lambda}
MemorylessP(X>s+t∣X>s)=P(X>t)P(X > s+t \mid X > s) = P(X > t)