All Revision Notes

COM6005 Statistical Modeling · Module 2b

Binomial, Geometric & Poisson Distributions

COM6005 · Module 2b · Source: Module_2b_OtherDist_Class_L02_Complete.pdf (15 slides;封面標題寫 “Lecture 2c”,內容係 Binomial / Geometric / Poisson)

Contents · 7 sections

🎯 本講重點 (Learning outcomes)

  • 講出三個 discrete distribution 各自「數緊咩」、parameter 同 core conditions。
  • 記熟三條 PMF 公式並識手計。
  • 由文字情境判斷應該用邊個 distribution(slide 10 三個 scenario)。
  • 識用 stats.binom.pmf、stats.geom.pmf、stats.poisson.pmf(同 .cdf)計答案。

⭐ 考試必溫 Top-5

  1. Summary 表(slide 8):Binomial = successes in n trials(n, p);Geometric = trials until 1st success(p);Poisson = events in an interval(λ\lambda)。
  2. Binomial PMF:(nk)pk(1−p)n−k\binom{n}{k}p^k(1-p)^{n-k};Scenario 3:15 次擲硬幣得 8 個 head = 0.1964。
  3. Geometric PMF:(1−p)k−1p(1-p)^{k-1}p;Scenario 2:80% 命中率,第 3 次先第一次入 = 0.0320;籃球 p=0.4p = 0.4 第 4 次 = 0.0864。
  4. Poisson PMF:λke−λ/k!\lambda^k e^{-\lambda}/k!;Scenario 1:λ=4.5\lambda = 4.5,剛好 6 個 call = 0.1281。
  5. scipy 寫法:poisson.pmf(6,4.5)、geom.pmf(3,0.8)、binom.pmf(8,15,0.5)。

1. Binomial Distribution

⭐ 定義(slide 2)
  • What it measures:The number of successes (X) out of a fixed total number of independent trials (n).
  • Key parameters:n = number of trials;p = probability of success on any given trial.
  • Core conditions:Each trial has only two outcomes, the probability p is constant, and all trials are independent.
  • Example:Flipping a coin 10 times and counting the exact k number of heads (X=kX = k),X 可以係 0, 1, 2, …, 10。
P(X=k)=(nk)pk(1−p)n−k,(nk)=n!k!(n−k)!,k∈{0,1,…,n}P(X=k) = \binom{n}{k} p^k (1-p)^{n-k}, \qquad \binom{n}{k} = \frac{n!}{k!(n-k)!}, \qquad k \in \{0,1,\dots,n\}

每部分嘅意思(slide 9):

  • (nk)\binom{n}{k}(Combination):由 n 次 trials 揀邊 k 次成功嘅方法數。
  • pkp^k:k 次成功嘅 probability。
  • (1−p)n−k(1-p)^{n-k}:其餘 n−kn - k 次失敗嘅 probability。
💡 直覺理解

想像 10 次擲硬幣,「HHTHT…」任何一個特定序列(有 k 個 H)嘅機率都係 pk(1−p)n−kp^k(1-p)^{n-k};而有 k 個 H 嘅序列有 (nk)\binom{n}{k} 個,所以相乘。

🖼️ 圖片內容

Slides 3、5、7 係 Wikipedia 上 Binomial / Geometric / Poisson distribution 嘅公式截圖(infobox),文字擷取不到;公式本身已喺 slide 9 列出,本頁已收錄。

2. Geometric Distribution

⭐ 定義(slide 4)
  • What it measures:The total number of trials (X) needed until the first success occurs.
  • Key parameter:p = probability of success on each trial.
  • Core conditions:Trials are independent, each has two outcomes, and the experiment stops immediately once the first success happens.
  • Example:Rolling a six-sided die repeatedly until you finally roll a 6.
P(X=k)=(1−p)k−1 p,k∈{1,2,3,… }P(X=k) = (1-p)^{k-1}\, p, \qquad k \in \{1,2,3,\dots\}
  • (1−p)k−1(1-p)^{k-1}:頭 k−1k - 1 次連續失敗。
  • pp:第 k 次(最後一次)成功。
⭐ Slide 4 例子:籃球第 4 次先第一次入

p=0.4p = 0.4。Prob(X=4)\text{Prob}(X = 4) → 頭 3 次失敗,第 4 次成功:

P(X=4)=(1−0.4)3×0.4=0.216×0.4=0.0864P(X=4) = (1-0.4)^3 \times 0.4 = 0.216 \times 0.4 = 0.0864
⚠️ 常見錯誤
  • 指數係 k−1k - 1(唔係 k):第 k 次成功之前只有 k−1k - 1 次失敗。
  • 本課(同 scipy.stats.geom)用嘅定義係「總 trial 數」,k 由 1 開始。有啲書用「失敗次數」定義(由 0 開始),公式會變成 (1−p)kp(1-p)^k p,小心題目寫法。

3. Poisson Distribution

⭐ 定義(slide 6)
  • What it measures:The number of times a discrete event occurs over a fixed period of time or space.
  • Key parameter:λ\lambda (lambda) = the average rate of occurrence in that interval.
  • Core conditions:Events occur independently, the average rate is constant, and two events cannot happen at the exact same instant.
  • Example:Counting the number of emails you receive in an hour.
P(X=k)=λke−λk!,k∈{0,1,2,… }P(X=k) = \frac{\lambda^k e^{-\lambda}}{k!}, \qquad k\in\{0,1,2,\dots\}

λ\lambda = 時段內平均次數;e≈2.71828e \approx 2.71828(Euler's constant);k!k! = k 嘅 factorial。

⚠️ 常見錯誤

λ\lambda 一定要配合題目嘅時段:如果「平均每分鐘 4.5 個 call」而題目問「2 分鐘內」,就要用 λ=9\lambda = 9。Poisson 冇上限(k 可以去到無限),Binomial 最多 n。

4. Summary:三個 distribution 點分?

⭐ Summary 表(slide 8)
FeatureBinomialGeometricPoisson
What is counted?Number of successes in n trialsNumber of trials until 1st successNumber of events in an interval
Fixed limit?Fixed number of trials (n)No fixed limit (stops at success)Fixed interval of time/space
Main Parametersn and ppλ\lambda (lambda)
Range of X(slide 9)0,1,…,n0, 1, \dots, n1, 2, 3, …0, 1, 2, …
PMF(nk)pk(1−p)n−k\binom{n}{k}p^k(1-p)^{n-k}(1−p)k−1p(1-p)^{k-1}pλke−λ/k!\lambda^k e^{-\lambda}/k!
scipystats.binom.pmf(k, n, p)stats.geom.pmf(k, p)stats.poisson.pmf(k, mu)
💡 判斷口訣(補充)
  • 題目有「n 次中有 k 次」→ Binomial。
  • 題目有「直到第一次」、「第 k 次先成功」→ Geometric。
  • 題目有「平均每(小時/分鐘/平方米)λ\lambda 次」,冇 n → Poisson。

補充(slides 冇列,但常用):Binomial mean=np\text{mean} = np、variance=np(1−p)\text{variance} = np(1-p);Geometric mean=1/p\text{mean} = 1/p;Poisson mean=variance=λ\text{mean} = \text{variance} = \lambda。Module 2c 嘅 approximation 會用到 npnp 同 np(1−p)np(1-p)。

5. Worked examples(slides 10–15)

Slide 10 三個 scenario:

  1. Scenario 1:Call center 平均每分鐘 4.5 個 call,求下一分鐘剛好 6 個 call 嘅 probability。
  2. Scenario 2:籃球員罰球命中率 80%,求佢頭兩球唔入、第三球先第一次入嘅 probability。
  3. Scenario 3:硬幣擲 15 次,求剛好 8 次 head 嘅 probability。
⭐ Solution 1:Poisson(slide 11)

Why:counting independent events (calls) in a fixed interval of time (1 minute) given an average rate λ=4.5\lambda = 4.5。

P(X=6)=4.56 e−4.56!=8303.77×0.0111720≈0.1281P(X=6) = \frac{4.5^6\, e^{-4.5}}{6!} = \frac{8303.77 \times 0.0111}{720} \approx 0.1281

Result:12.81% chance the center receives exactly 6 calls in the next minute.

⭐ Solution 2:Geometric(slide 12)

Why:independent trials with constant success rate p=0.80p = 0.80 until the very first success on the 3rd attempt (x=3x = 3)。

P(X=3)=(1−0.80)3−1×0.80=(0.20)2×0.80=0.04×0.80=0.0320P(X=3) = (1-0.80)^{3-1}\times 0.80 = (0.20)^2 \times 0.80 = 0.04 \times 0.80 = 0.0320

Result:3.20% chance the first successful shot happens exactly on the third try.

⭐ Solution 3:Binomial(slide 13)

Why:fixed number of independent trials (n=15n = 15), constant p=0.50p = 0.50, specific number of successes (k=8k = 8)。

P(X=8)=(158)(0.5)8(1−0.5)15−8=6435×0.003906×0.0078125≈0.1964P(X=8) = \binom{15}{8}(0.5)^8(1-0.5)^{15-8} = 6435 \times 0.003906 \times 0.0078125 \approx 0.1964

Result:19.64% chance of exactly 8 heads out of 15 flips.

5.1 Python code(slides 14–15)

Slide 14 係填充題(stats.XXX.pmf(??)),slide 15 係答案:

import scipy.stats as stats
# Scenario 1: Poisson,k = 6,λ = 4.5
prob1 = stats.poisson.pmf(6, 4.5)
print(f"Scenario 1 - Probability: {prob1:.4f}")   # 0.1281
# Scenario 2: Geometric,k = 3,p = 0.8
prob2 = stats.geom.pmf(3, 0.8)
print(f"Scenario 2 - Probability: {prob2:.4f}")   # 0.0320
# Scenario 3: Binomial,k = 8,n = 15,p = 0.5
prob3 = stats.binom.pmf(8, 15, 0.5)
print(f"Scenario 3 - Probability: {prob3:.4f}")   # 0.1964
⚠️ 參數次序

scipy 一律係 先 k,後 parameter:binom.pmf(k, n, p)、geom.pmf(k, p)、poisson.pmf(k, mu)。寫錯次序(例如 binom.pmf(15, 8, 0.5))會得到 0。

5.2 延伸練習:「至少/最多」要用 CDF

💡 Worked examples(補充)
  • Scenario 1 延伸:最多 2 個 call:P(X≤2)=e−4.5(1+4.5+4.522)=0.01111×15.625≈0.1736P(X\le 2) = e^{-4.5}(1 + 4.5 + \frac{4.5^2}{2}) = 0.01111 \times 15.625 \approx 0.1736(stats.poisson.cdf(2, 4.5));至少 3 個 =1−0.1736=0.8264= 1 - 0.1736 = 0.8264。
  • Scenario 2 延伸:3 球內入到第一球:P(X≤3)=1−(0.2)3=0.992P(X\le 3) = 1-(0.2)^3 = 0.992(stats.geom.cdf(3, 0.8))。
  • Scenario 3 延伸:至少 1 個 head:1−P(X=0)=1−0.515≈0.999971 - P(X=0) = 1 - 0.5^{15} \approx 0.99997。

自我測驗 Self-test

Q1. 一間店平均每小時有 3 個客投訴。求某一小時冇人投訴嘅 probability。

Poisson,λ=3\lambda = 3:P(X=0)=e−3≈0.0498P(X=0) = e^{-3} \approx 0.0498。Python:stats.poisson.pmf(0, 3)。

Q2. 一條選擇題有 4 個選項,學生亂估 10 題。求剛好答啱 3 題嘅 probability。

Binomial,n=10n = 10,p=0.25p = 0.25:(103)(0.25)3(0.75)7=120×0.015625×0.13348≈0.2503\binom{10}{3}(0.25)^3(0.75)^7 = 120 \times 0.015625 \times 0.13348 \approx 0.2503。

Q3. 某人每次打電話搵到客服嘅機會係 0.3。求佢第 5 次先第一次接通嘅 probability。

Geometric,p=0.3p = 0.3,k=5k = 5:(0.7)4×0.3=0.2401×0.3=0.07203(0.7)^4 \times 0.3 = 0.2401 \times 0.3 = 0.07203。

Q4. 擲公平骰子直至出 6。求第 2 次就出 6 嘅 probability。

(5/6)1×1/6=5/36≈0.1389(5/6)^1 \times 1/6 = 5/36 \approx 0.1389。

Q5. 某網站平均每分鐘 2 次 visit,求 3 分鐘內剛好 5 次 visit 嘅 probability。

3 分鐘 → λ=6\lambda = 6:65e−6/5!=7776×0.002479/120≈0.16066^5 e^{-6}/5! = 7776 \times 0.002479/120 \approx 0.1606。

Q6. 以下邊個唔符合 Binomial 條件?(a) 由一副牌唔放返咁抽 5 張,數有幾多張紅心 (b) 擲 20 次硬幣數 head

(a) 唔符合:唔放返 → 每次 p 會變,trials 唔 independent(應該用 hypergeometric)。(b) 符合。

Q7. 寫出 Scenario 1–3 嘅 scipy code,並講出 “k” 喺每個 function 係邊個 argument。

stats.poisson.pmf(6, 4.5)、stats.geom.pmf(3, 0.8)、stats.binom.pmf(8, 15, 0.5);k 一律係第一個 argument。

Q8. Binomial(n=15,p=0.5)\text{Binomial}(n = 15, p = 0.5):求 P(X≥14)P(X \ge 14)。

P(14)+P(15)=[(1514)+1]/215=16/32768≈0.000488P(14) + P(15) = [\binom{15}{14} + 1]/2^{15} = 16/32768 \approx 0.000488。Python:1 - stats.binom.cdf(13, 15, 0.5)。

一頁總結 Cheat sheet

⭐ 考前速記
  • Binomial(n, p):n 次 independent trials 中成功次數;兩個結果、p 固定。P(X=k)=(nk)pk(1−p)n−kP(X=k)=\binom{n}{k}p^k(1-p)^{n-k},k=0..nk = 0..n。
  • Geometric(p):直到第一次成功嘅 trial 數。P(X=k)=(1−p)k−1pP(X=k)=(1-p)^{k-1}p,k=1,2,…k = 1, 2, \dots
  • Poisson(λ\lambda):固定時間/空間內事件數。P(X=k)=λke−λ/k!P(X=k)=\lambda^k e^{-\lambda}/k!,k=0,1,…k = 0, 1, \dots;λ\lambda 要跟時段調整。
  • Scenario 答案:Poisson(4.5) P(6)=0.1281P(6) = 0.1281;Geom(0.8) P(3)=0.0320P(3) = 0.0320;Binom(15, 0.5) P(8)=0.1964P(8) = 0.1964;Geom(0.4) P(4)=0.0864P(4) = 0.0864。
  • scipy:binom.pmf(k,n,p)、geom.pmf(k,p)、poisson.pmf(k,mu);累積用 .cdf;「至少」=1−cdf(k−1)= 1 - \text{cdf}(k-1)。
  • 補充:Binomial mean npnp、var np(1−p)np(1-p);Geometric mean 1/p1/p;Poisson mean=var=λ\text{mean} = \text{var} = \lambda。