Poisson Distribution

 

馃搳 Poisson Distribution 

The Poisson distribution models the number of times an event occurs in a fixed interval (time, space, area, volume, etc.) when events happen:

  • independently

  • at a constant average rate

  • rarely relative to the interval size


When do we use Poisson?

Use it when counting events like:

  • 馃摓 number of calls arriving at a call center per minute

  • 馃殫 number of cars passing a signal in 1 minute

  • 馃К mutations in a DNA segment

  • 馃導 number of raindrops hitting a sensor per second

  • 馃彞 number of patients arriving in an hour


Probability formula

If

XPoisson()X \sim \text{Poisson}(\lambda)

then

P(X=k)=kek!,k=0,1,2,P(X=k)=\frac{\lambda^k e^{-\lambda}}{k!}, \quad k=0,1,2,\dots

Parameters

SymbolMeaning
kk
        number of events
\lambda
        average events per interval (rate)
ee
        Euler's constant ≈ 2.718

Key properties

Mean and variance

E[X]=E[X]=\lambda Var(X)=\text{Var}(X)=\lambda

馃憠 Mean equals variance — a special Poisson feature.


Standard deviation

=\sigma=\sqrt{\lambda}

Example 1 — Phone calls

A call center receives 4 calls per minute on average.

=4\lambda=4

Probability of exactly 2 calls in a minute:

P(X=2)=42e42!=16e42=8e4P(X=2)=\frac{4^2 e^{-4}}{2!} =\frac{16e^{-4}}{2} =8e^{-4}

Since

e40.0183e^{-4}\approx0.0183
P(X=2)8×0.0183=0.146P(X=2)\approx8\times0.0183=0.146

✅ About 14.6% chance


Example 2 — Rare defects

A factory produces 0.5 defects per meter of wire.

=0.5\lambda=0.5

Probability of zero defects in one meter:

P(X=0)=e0.5=0.6065P(X=0)=e^{-0.5}=0.6065

✅ About 60.6% chance


Example 3 — Cars at a signal

Average 6 cars per minute

=6\lambda=6

Probability of at most 1 car:

P(X1)=P(0)+P(1)P(X\le1)=P(0)+P(1)
P(0)=e6=0.00248P(0)=e^{-6}=0.00248
P(1)=6e6=0.0149P(1)=6e^{-6}=0.0149
P(X1)=0.0174P(X\le1)=0.0174

✅ Very unlikely (≈1.7%)


Intuition: Why Poisson works

Imagine dividing time into tiny slots:

  • probability of event in each slot is very small

  • events independent

This is like a limit of Binomial distribution:

Binomial(n,p),n,  p0,  np=\text{Binomial}(n,p),\quad n\to\infty,\; p\to0,\; np=\lambda

Then:

BinomialPoisson\text{Binomial} \rightarrow \text{Poisson}

Shape of Poisson distribution

  • Small 位 → skewed right

  • Large 位 → becomes symmetric

  • Very large 位 → approximates Normal distribution

Rule of thumb:

>10Normal approx works well\lambda>10 \Rightarrow \text{Normal approx works well}

Additivity property (very useful)

If

X1Poisson(1),X2Poisson(2)X_1\sim\text{Poisson}(\lambda_1),\quad X_2\sim\text{Poisson}(\lambda_2)

independent, then

X1+X2Poisson(1+2)X_1+X_2\sim\text{Poisson}(\lambda_1+\lambda_2)

Example:

  • morning calls: 位=3

  • afternoon calls: 位=5

Total day:

=8\lambda=8

Connection to waiting times

Poisson counts events.

The time between events follows:

Exponential()\text{Exponential}(\lambda)

This link is fundamental in:

  • queueing theory

  • reliability engineering

  • survival analysis


Real-life interpretation of 位

=rate×interval length\lambda = \text{rate} \times \text{interval length}

Example:

  • 2 emails/hour

  • in 3 hours:

=2×3=6\lambda=2\times3=6

Small Python example

from math import exp, factorial lam = 4 k = 2 p = (lam**k * exp(-lam)) / factorial(k) print(p)

✔️ Summary

Poisson distribution models:

✅ counts of events
✅ independent occurrences
✅ constant average rate
✅ rare events in small intervals

Formula:

P(X=k)=kek!P(X=k)=\frac{\lambda^k e^{-\lambda}}{k!}

Mean = Variance = 位

Comments

Popular posts from this blog

Advanced Mathematics for Computer Science HNCST409 KTU BTech Honors 2024 Scheme

Convex and Non Convex Sets

Gradient-Based Methods for Optimization-Gradient Descent Algorithm