Course contentsShow
← Computer Science
Lesson 129 of 2,8723. Probability for Computer ScienceFree lesson

Exponential Distribution

Model waiting times for memoryless processes; apply exponential distribution with rate parameter λ.

Exponential Distribution

You'll learn how to model the time you wait for random, memoryless events — like the next server request or hardware failure.

What Is the Exponential Distribution?

The exponential distribution describes how long you wait for something to happen when events occur continuously and randomly at a constant average rate. It's defined by a single parameter, λ (lambda), called the rate parameter, which tells you how many events happen per time unit on average.

Unlike the geometric distribution (which counts discrete trials), the exponential distribution measures continuous time.

The Memoryless Property

The key insight: the past doesn't matter. If you've already waited 5 minutes for a server response, the probability distribution for how much longer you'll wait is exactly the same as when you started. The system has "no memory" of how long you've been waiting.

This makes it perfect for modeling:

  • Time between incoming network packets
  • Time until the next system crash
  • Duration until a process completes

The Math

The probability density function (PDF) is:

f(x) = λe^(-λx) for x ≥ 0

The cumulative distribution function (CDF), which gives P(wait time ≤ x), is:

F(x) = 1 - e^(-λx)

Higher λ means events happen faster (shorter average wait). The average waiting time is 1/λ.

Example

If server requests arrive at λ = 2 per minute, the average wait between requests is 1/2 = 0.5 minutes. The probability you wait less than 1 minute is F(1) = 1 - e^(-2) ≈ 0.86 or 86%.

Key Takeaway: The exponential distribution models continuous waiting times for memoryless random processes using rate parameter λ; it's essential for analyzing system performance and reliability.