PROBABILITY & STATISTICS / 4. DISCRETE DISTRIBUTIONS
Random Variables & Discrete Distributions
Bernoulli, Binomial, Poisson — modeling count data
EXPLANATION
A Random Variable maps outcomes of a random experiment to numbers. • Discrete RV → countable values (0,1,2,...). Described by PMF • Continuous RV → any value in a range. Described by PDF PMF (Probability Mass Function): P(X=x) — probability of each exact value. CDF (Cumulative Distribution Function): F(x) = P(X ≤ x) — probability up to x. Key discrete distributions: Uniform: P(X=x) = 1/n for each of n outcomes. E[X]=(a+b)/2, Var=(b-a+1)²-1)/12 Bernoulli(p): single trial, success or failure. P(X=1)=p, P(X=0)=1-p. E[X]=p, Var=p(1-p) Binomial(n,p): n independent Bernoulli trials, count successes. P(X=k) = C(n,k) × pᵏ × (1-p)ⁿ⁻ᵏ. E[X]=np, Var=np(1-p) Poisson(λ): count of events in fixed time/space, when events are rare and independent. P(X=k) = e^(-λ) × λᵏ / k!. E[X]=λ, Var=λ Used for: website hits/hour, typos/page, calls/minute.
DIAGRAM
Bernoulli(p=0.3): Binomial(n=10, p=0.3): P(X=0) = 0.7 P(X=k) = C(10,k)×0.3ᵏ×0.7^(10-k) P(X=1) = 0.3 Peak at k=np=3 Poisson(λ=3): P(X=0) = e⁻³ ≈ 0.050 P(X=1) = 3e⁻³ ≈ 0.149 P(X=2) = 4.5e⁻³ ≈ 0.224 P(X=3) = 4.5e⁻³ ≈ 0.224 ← peak at λ Key relationships: Binomial(n,p) → Poisson(λ=np) when n→∞, p→0, np=const Sum of Bernoullis = Binomial
CODE