Modeling With the Exponential Distribution

Apply the exponential distribution to real-world waiting-time problems: extracting the rate parameter from context, computing tail and interval probabilities, exploiting the memoryless property, and solving inverse problems for threshold times.

Step 1 of 157%

Tutorial

Modeling Waiting Times

Many real-world waiting times — the time until the next call at a help desk, until a radioactive atom decays, or until the next bus arrives — are modeled by the exponential distribution. If events occur randomly at an average rate of λ\lambda events per unit of time, then the waiting time XX until the next event satisfies

XExp(λ),X \sim \text{Exp}(\lambda),

with cumulative distribution function

P(Xt)=1eλt,t0,P(X \le t) = 1 - e^{-\lambda t}, \qquad t \ge 0,

and survival function

P(X>t)=eλt,t0.P(X > t) = e^{-\lambda t}, \qquad t \ge 0.

The mean waiting time is E[X]=1λE[X] = \dfrac{1}{\lambda}.

When a problem describes a mean waiting time μ\mu instead of a rate, set λ=1μ\lambda = \dfrac{1}{\mu} before applying the formulas. Always make sure λ\lambda and tt are expressed in compatible units.

For example, suppose calls arrive at a help desk at a rate of λ=4\lambda = 4 calls per hour. The probability we wait more than 3030 minutes (so t=0.5t = 0.5 hours) for the next call is

P(X>0.5)=e40.5=e20.135.P(X > 0.5) = e^{-4 \cdot 0.5} = e^{-2} \approx 0.135.
navigate · Enter open · Esc close · ⌘K/Ctrl K toggle