Skip to content
datarekha

Exponential & Poisson

Back at the bus stop: how long until the next bus, and how many arrive in an hour? One is a waiting time, the other a count, and a single rate λ governs both. The exponential's strange 'no more due now than a minute ago' property answers the question the last lesson left open.

9 min read Intermediate GATE DA Lesson 12 of 122

What you'll learn

  • Exponential(λ): density, CDF, mean = 1/λ, variance = 1/λ²
  • The memoryless property: a used exponential clock is as good as new
  • Poisson(λ) PMF, and its signature — mean equals variance equals λ
  • Solving for λ from a mean/variance condition (a real 2024 NAT)

Before you start

Back to the bus stop the last lesson left us at. Buses come at random — sometimes two within a minute, sometimes a long empty stretch. Two natural questions hang in the air. How long until the next bus? That answer is a continuous waiting time. How many buses arrive in the next hour? That answer is a whole-number count. Remarkably, one single dial governs both — a rate of events per unit time, written λ — so we learn the two together.

The waiting time

The time you wait for the next event is the exponential distribution. Its density slopes down from the start — short waits are common, long ones rare, with a thin tail trailing off — exactly the shape the last lesson predicted for a waiting time.

λf(x) = λe−λx, x ≥ 0xwaiting time — most waits are short, a long tail of rare long ones
The density peaks at 0 and decays; the rate λ sets how fast.
  • Density: f(x) = λ·e^(−λx) for x ≥ 0 — the height of the curve, which tells you where probability is concentrated rather than any probability directly.
  • CDF: F(x) = 1 − e^(−λx) — the running total of probability accumulated up to x, i.e. P(X ≤ x). So the chance of still waiting past x is P(X > x) = e^(−λx).
  • Mean: E(X) = 1/λ — a faster rate λ means a shorter average wait, just as you would expect.
  • Variance: Var(X) = 1/λ².

The strange property the bus has

Here is the “no more due now” idea the last lesson dangled. The exponential forgets the past. If you have already waited s minutes, the chance of waiting at least t more is exactly the chance a fresh arrival waits t — your ten minutes of standing there bought you nothing:

P(X > s + t | X > s) = P(X > t)

A bus that has not come in ten minutes is no more “due” than one you just started waiting for. The exponential is the only continuous distribution with this memorylessness, and GATE leans on it constantly.

Almost everyone objects to this the first time. The objection is worth answering rather than waving away. It goes: the density is decaying, long waits are rare, so surely after ten empty minutes the bus must be nearly here?

The two facts do not collide. “Long waits are rare” is a statement about the whole wait, judged before you arrive at the stop. Once you have already stood there ten minutes, you are no longer looking at a fresh draw. You have conditioned on being in the tail, and what remains of the tail has exactly the shape the whole thing started with.

Your expected remaining wait is still 1/λ, not 1/λ − 10.

The feeling that waiting “builds up credit” is the gambler’s fallacy wearing a stopwatch. A memoryless process keeps no counter of how long you have been patient. This is also the honest test of whether the exponential is the right model at all: it fits things that do not age, like radioactive decay or a component with no wear-out mechanism, and fits a timetabled bus rather badly.

Open the Exponential tab below, drag the rate λ, and watch the curve steepen as faster events shorten the wait.

Trydistribution explorer

Drag the handles to read off a probability

PDFP = 0.683
-4.0-2.00.02.04.0
P(-1.00 < X < 1.00)
CDFcumulative
-4.0-2.00.02.04.0
P(a < X < b)0.683F(b) − F(a) = 0.841 − 0.159
0 draws

The count

Now the other question — how many events land in one interval. That count is the Poisson distribution, the exponential’s discrete partner, sharing the same rate λ:

P(X = k) = e^(−λ) · λ^k / k! ,   k = 0, 1, 2, …

Its signature fact, and a GATE favourite, is that its two summary numbers are equal:

Poisson(λ)mean = var = λExponential(λ)mean 1/λ, var 1/λ²
Keep them straight: Poisson mean = variance; the exponential’s variance is the square of its mean.

For a Poisson, both the mean and the variance equal λ — a true fact, tested again in GATE DA 2024.

One quick pass through the PMF makes it concrete. If calls arrive at λ = 2 per minute, the chance of exactly one call in a minute is e^(−2)·2¹/1! = 2·e^(−2) ≈ 2 × 0.1353 = 0.271. Note the k! in the denominator: it is what keeps the probabilities from exploding as k grows.

A worked example — a real 2024 question

Let X be Exponential(λ). If 5·E(X) = Var(X), find λ.

Substitute the two formulas and the rest is algebra:

E(X) = 1/λ,   Var(X) = 1/λ²

5 · E(X) = Var(X)
5 · (1/λ) = 1/λ²
5/λ      = 1/λ²

multiply both sides by λ²:
5λ = 1   ⟹   λ = 0.2

So λ = 0.2. The whole question was really “do you know E(X) = 1/λ and Var(X) = 1/λ²?” Answer that and it falls out in two lines.

A question to carry forward

The exponential and Poisson are the shapes of random arrivals. But the most famous continuous shape of all is none of these. It appears whenever many small, independent effects pile up: heights, measurement errors, the average of a big sample.

Here is the thread onward: what is that bell-shaped distribution, and why does looking things up in it always start by “standardising” a value first?

In one breath

  • One rate λ governs both: exponential = continuous waiting time to the next event; Poisson = discrete count of events in an interval.
  • Exponential(λ): f = λe^(−λx), F = 1 − e^(−λx), P(X>x) = e^(−λx); mean 1/λ, variance 1/λ²; the unique memoryless distribution.
  • Poisson(λ): P(X=k) = e^(−λ)·λ^k/k!; mean = variance = λ (the signature fact).
  • The reliable NAT: solve for λ from a mean/variance relation — 2024: 5·E(X)=Var(X)5/λ = 1/λ²λ = 0.2.
  • Do not swap: exponential variance 1/λ² (square of the mean); Poisson variance equals the mean.

Practice

Quick check

0/6
Q1Recall: which models a waiting TIME and which models a COUNT of events?
Q2Trace: X ~ Exponential(λ) with 5·E(X) = Var(X). Find λ. (the real 2024 question)numerical answer — type a number
Q3Trace: calls arrive Poisson with mean 4 per minute. What is the variance of the number of calls in one minute?numerical answer — type a number
Q4Apply: X ~ Exponential(λ) with mean 2. Compute P(X > 1). Use e^(−0.5) ≈ 0.6065. (3 decimals)numerical answer — type a number
Q5Apply: which statements are TRUE? (select all that apply)select all that apply
Q6Create: a server gets requests as a Poisson process at 3 per second. Write P(exactly 0 requests in one second) and evaluate it. Use e^(−3) ≈ 0.0498.

Sign in to track your progress

Completed lessons, your XP, level, and streak save to your account — it's free and takes a few seconds.

Practice this in an interview

All questions
When do you use the Poisson distribution versus the Binomial, and how do they relate?

Binomial counts successes in a fixed number of independent trials with a fixed success probability. Poisson counts events in a continuous interval when events are rare and arrive independently at a constant average rate. Poisson is the limiting case of Binomial as n → ∞ and p → 0 with np = λ fixed.

What is the memoryless property of the Exponential distribution, and why does it matter?

An Exponential random variable satisfies P(X > s+t | X > s) = P(X > t): the remaining waiting time has the same distribution regardless of how long you have already waited. This is the only continuous distribution with this property, and it directly corresponds to a constant hazard rate — neither ageing nor improving over time.

When does each common distribution arise — Bernoulli, Binomial, Poisson, Normal, Exponential, Uniform?

Each distribution has a natural generative story: Bernoulli is a single coin flip; Binomial sums Bernoullis; Poisson counts rare arrivals; Normal emerges from sums of many small effects; Exponential models waiting times between Poisson events; Uniform assigns equal probability across a range. Choosing correctly comes from matching that story to the data-generating process.

How does the Bernoulli distribution relate to the Binomial, and what are their parameters and moments?

A Bernoulli(p) trial is the atomic unit: a single experiment with success probability p. Binomial(n, p) is the sum of n independent, identically distributed Bernoulli(p) trials, counting total successes. Because Binomial is a sum of independent random variables, its mean and variance are n times those of a single Bernoulli.

Related lessons

Explore further