Business Statistics for Entrepreneurs

Random Variables and Discrete Probability Distributions

Module 2

Core Concepts

  • Random Variables: Quantify outcomes of random phenomena, mapping them to numerical values.
  • Probability Distributions: Describe the likelihood of each possible value for a random variable using Probability Mass Functions (PMF) or Cumulative Distribution Functions (CDF).
  • Key Characteristics: Expectation (mean) and Variance (spread) summarize the central tendency and variability of a random variable.
  • Discrete Distributions: Specific models like Bernoulli, Binomial, and Poisson describe common discrete random processes (single trials, multiple trials, rare events).
  • Independence & Combinations: Properties of sums or linear combinations of independent random variables can be derived from individual variable properties.

Definitions

  • Random Variable (RV): A variable whose value is a numerical outcome of a random phenomenon. Typically denoted by an uppercase letter (e.g., X).
  • Probability Mass Function (PMF): For a discrete RV, a function f(x) = P(X=x) that gives the probability that the RV X takes on a specific value x.
  • Cumulative Distribution Function (CDF): A function F(x) = P(X ≤ x) that gives the probability that the RV X takes on a value less than or equal to x.
  • Tail Probability: The probability that an RV X takes on a value greater than x, calculated as P(X > x) = 1 - F(x).
  • Expectation (Mean, E[X] or μ): The weighted average of the possible values of an RV, where weights are the probabilities. Represents the long-run average value.
  • Variance (Var(X) or σ²): The expectation of the squared deviation of an RV from its mean, E[(X - μ)²]. Measures the spread or dispersion of the distribution.
  • Standard Deviation (SD or σ): The square root of the variance, providing a measure of spread in the original units of the RV.

Random Variables (General Properties)

Definition

A function that assigns a numerical value to each outcome in the sample space of a random experiment.

Key Insights

  • The PMF, f(x), specifies the probability P(X=x) for each possible discrete value x. The sum of all PMF values must equal 1.
  • The CDF, F(x), accumulates probabilities, representing P(X ≤ x). It is non-decreasing, starting at 0 and ending at 1.
  • Expectation provides the central point or average value of the distribution.
  • Variance quantifies the average squared distance of values from the mean, indicating variability. Standard deviation is the square root of variance.

Formula

ƒProbability Mass Function (PMF)
f(x)=P(X=x)f(x) = P(X = x)
Where: f(x)f(x) is the probability that the discrete random variable XX takes the value xx, and the PMF values over all possible xx sum to 1.
ƒCumulative Distribution Function (CDF)
F(x)=P(Xx)F(x) = P(X \le x)
Where: F(x)F(x) accumulates probability up to and including xx. It is non-decreasing, starting at 0 and ending at 1.
ƒTail Probability
P(X>x)=1F(x)P(X > x) = 1 - F(x)
Where: it is the probability that XX exceeds xx, the complement of the CDF.
ƒExpectation (Discrete RV)
E[X]=xxP(X=x)=xxf(x)E[X] = \sum_{x} x \, P(X = x) = \sum_{x} x \, f(x)
Where: the sum runs over all possible values xx of the random variable, weighted by their probabilities.
ƒVariance (Discrete RV)
Var(X)=E[(XE[X])2]=x(xE[X])2f(x)\text{Var}(X) = E[(X - E[X])^2] = \sum_{x} (x - E[X])^2 f(x)
Where: it is the average squared distance of the values from the mean.
ƒVariance (computational form)
Var(X)=E[X2](E[X])2\text{Var}(X) = E[X^2] - (E[X])^2
Where: it is an equivalent shortcut, the mean of the squares minus the square of the mean.
ƒStandard Deviation (Discrete RV)
SD(X)=Var(X)\text{SD}(X) = \sqrt{\text{Var}(X)}
Where: it restates the spread in the original units of the random variable.
ƒExpectation of a Sum of Independent RVs
E[S]=i=1nE[Xi]=nμE[S] = \sum_{i=1}^{n} E[X_i] = n\mu
Where: X1,,XnX_1, \dots, X_n are independent random variables each with mean μ\mu, and SS is their sum.
ƒVariance of a Sum of Independent RVs
Var(S)=i=1nVar(Xi)=nσ2\text{Var}(S) = \sum_{i=1}^{n} \text{Var}(X_i) = n\sigma^2
Where: each XiX_i has variance σ2\sigma^2, and independence is what allows the variances to be added.

Bernoulli Distribution

Bernoulli Distribution - Definition

Models a single trial with exactly two possible outcomes, conventionally labeled "success" (usually coded as 1) and "failure" (usually coded as 0).

Bernoulli Distribution - Key Insights

  • Characterized by a single parameter, p, the probability of success.
  • The probability of failure is q = 1 - p.
  • It is the fundamental building block for the Binomial distribution.

Bernoulli Distribution - Examples

  • A single coin toss (Heads/Tails).
  • The outcome of a single customer call (Purchase/No Purchase).
  • Testing a single item (Defective/Not Defective).

Bernoulli Distribution - Formula

ƒBernoulli PMF
f(y;p)=py(1p)1y,y{0,1}f(y; p) = p^{y} (1-p)^{1-y}, \quad y \in \{0, 1\}
Where: pp is the probability of success and qq the probability of failure. The outcome yy is 1 for success, with probability pp, and 0 for failure, with probability qq.
ƒBernoulli Expectation
E[Y]=pE[Y] = p
Where: the long-run average of a single Bernoulli trial is just the success probability.
ƒBernoulli Variance
Var(Y)=p(1p)=pq\text{Var}(Y) = p(1-p) = pq
Where: the spread is largest when pp is 0.5 and shrinks towards 0 at either extreme.

Binomial Distribution

Binomial Distribution - Definition

Models the number of successes (y) in a fixed number (n) of independent and identical Bernoulli trials, where the probability of success (p) is constant for each trial.

Binomial Distribution - Key Insights

  • Requires parameters n (number of trials) and p (probability of success per trial).
  • Assumes trials are independent and have the same success probability.
  • Represents the sum of n independent Bernoulli(p) random variables.
  • Tools like MS Excel (BINOM.DIST function) can compute PMF (P(Y=y)) and CDF (P(Y≤y)) values.

Binomial Distribution - Examples

  • Number of heads in 10 coin tosses (n=10, p=0.5).
  • Number of successful insurance sales in 50 calls (n=50, p=estimated success rate).
  • Number of defective pumps found in a daily sample of 20 (n=20, p=defect rate, "success" defined as finding a defect).

Binomial Distribution - Comparisons

  • Bernoulli vs. Binomial: Bernoulli models a single trial (n=1), while Binomial models multiple trials (n > 1).

Binomial Distribution - Formula

ƒBinomial PMF
f(y;n,p)=P(Y=y)=(ny)py(1p)nyf(y; n, p) = P(Y = y) = \binom{n}{y} p^{y} (1-p)^{n-y}
Where: nn is the number of trials, pp the success probability per trial, and yy runs over 0, 1, up to nn.
ƒBinomial Coefficient
(ny)=n!y!(ny)!\binom{n}{y} = \frac{n!}{y!(n-y)!}
Where: read as "n choose y", it counts the number of ways yy successes can occur across nn trials.
ƒBinomial Expectation
E[Y]=npE[Y] = np
Where: it is the sum of the means of nn independent Bernoulli trials.
ƒBinomial Variance
Var(Y)=np(1p)=npq\text{Var}(Y) = np(1-p) = npq
Where: qq is the failure probability, and independence lets the nn Bernoulli variances be added.
ƒBinomial Standard Deviation
SD(Y)=np(1p)=npq\text{SD}(Y) = \sqrt{np(1-p)} = \sqrt{npq}
Where: it is the square root of the binomial variance, in the units of the count of successes.

Poisson Distribution

Poisson Distribution - Definition

Models the probability of a given number of events (y) occurring within a fixed interval of time, space, or other continuous measure, when these events occur independently at a constant average rate. Often used for rare events.

Poisson Distribution - Key Insights

  • Characterized by a single parameter, λ (lambda), representing the average number of events in the specified interval (the rate).
  • The random variable Y can take non-negative integer values (0, 1, 2, ...).
  • A key property is that the mean and variance are both equal to λ.
  • Related to the Poisson process, where inter-arrival times between events follow an Exponential distribution. The count of events up to time t, N(t), in such a process follows a Poisson distribution with parameter λt (if λ is the rate per unit time).

Poisson Distribution - Examples

  • Number of emails received per hour.
  • Number of defects per square meter of fabric.
  • Number of customer arrivals at a service counter per 10 minutes.
  • Number of likes on a social media post per day.

Poisson Distribution - Comparisons

  • Binomial vs. Poisson: Binomial counts successes in a fixed number of trials (n). Poisson counts events over a continuous interval (no fixed n), often applicable when n is very large and p is very small such that np ≈ λ.

Poisson Distribution - Formula

ƒPoisson PMF
f(y;λ)=P(Y=y)=eλλyy!f(y; \lambda) = P(Y = y) = \frac{e^{-\lambda} \lambda^{y}}{y!}
Where: λ\lambda is the average number of events per interval, ee is the base of the natural logarithm (about 2.71828), and yy runs over 0, 1, 2, and so on.
ƒPoisson Expectation
E[Y]=λE[Y] = \lambda
Where: the mean count over the interval is the rate parameter itself.
ƒPoisson Variance
Var(Y)=λ\text{Var}(Y) = \lambda
Where: for a Poisson variable the variance equals the mean, a defining property of the distribution.
ƒPoisson Standard Deviation
SD(Y)=λ\text{SD}(Y) = \sqrt{\lambda}
Where: it is the square root of the rate parameter.

Conclusion

This module introduces the foundational concept of random variables for quantifying uncertainty, characterized by their probability distributions (PMF/CDF), expectation, and variance. Building on this, three key discrete distributions are detailed: the Bernoulli for single two-outcome trials, the Binomial for counting successes across multiple independent Bernoulli trials, and the Poisson for modeling the occurrence of rare events over continuous intervals. Understanding these distributions and their properties (like the relationship between Binomial and Bernoulli, or the mean-variance equality in Poisson) is essential for analyzing probabilistic scenarios in various fields.