14.4 Random Variables, Expected Value, Variance, and Common Distributions

Key Takeaways

  • Expectation is unconditionally linear: E[sum a_i X_i + c] = sum a_i E[X_i] + c holds for all random variables regardless of whether they are independent.
  • Variance obeys quadratic scaling Var(aX + b) = a^2 Var(X), and Var(X + Y) = Var(X) + Var(Y) + 2Cov(X, Y); independent or uncorrelated variables have additive variances.
  • Uncorrelated random variables (Cov(X, Y) = 0) are not necessarily independent, as non-linear functional dependencies can have zero linear covariance.
  • The Geometric distribution (discrete) and Exponential distribution (continuous) are the unique distributions possessing the memoryless property P(X > s+t | X > s) = P(X > t).
  • Chebyshev's inequality guarantees P(|X - mu| >= k sigma) <= 1/k^2 for any distribution with finite variance, while the Central Limit Theorem establishes asymptotic normality of standardized sample sums.
Last updated: September 2026

14.4 Random Variables, Expected Value, Variance, and Common Distributions

Random variables and probability distributions on the GRE Mathematics Subject Test require mastery of distribution functions, linearity of expectation, variance and covariance algebra, common discrete and continuous families, and asymptotic limit theorems.


Random Variables and Distribution Functions

A random variable $X$ on $(\Omega, \mathcal{F}, P)$ is a Borel-measurable function $X: \Omega \to \mathbb{R}$.

PMF, PDF, and CDF

  • Discrete: Described by PMF $p_X(x) = P(X = x) \ge 0$ with $\sum_x p_X(x) = 1$.
  • Continuous: Described by PDF $f_X(x) \ge 0$ with $\int_{-\infty}^\infty f_X(x) , dx = 1$, where $P(a \le X \le b) = \int_a^b f_X(x) , dx$. For any single point $c$, $P(X = c) = 0$.
  • Cumulative Distribution Function (CDF): $F_X(x) = P(X \le x)$ for all variables. Every CDF satisfies:
    1. Monotonically non-decreasing: $x_1 < x_2 \implies F(x_1) \le F(x_2)$.
    2. Right-continuous: $\lim_{t \to x^+} F(t) = F(x)$.
    3. Limits: $\lim_{x \to -\infty} F(x) = 0$ and $\lim_{x \to \infty} F(x) = 1$.
    4. For continuous variables, $f_X(x) = F_X'(x)$ almost everywhere.

Expected Value and Linearity

The expected value $E[X]$ measures the center of the distribution: E[X]={∑xx pX(x)discrete∫−∞∞x fX(x) dxcontinuousE[X] = \begin{cases} \sum_x x \, p_X(x) & \text{discrete} \\[4pt] \int_{-\infty}^\infty x \, f_X(x) \, dx & \text{continuous} \end{cases} provided the sum or integral converges absolutely.

LOTUS and Unconditional Linearity

  • LOTUS: $E[g(X)] = \int_{-\infty}^\infty g(x) f_X(x) , dx$ or $\sum_x g(x) p_X(x)$.
  • Linearity: For any random variables $X_1, \dots, X_n$ and scalars $a_i, c \in \mathbb{R}$: E[∑i=1naiXi+c]=∑i=1naiE[Xi]+cE\left[\sum_{i=1}^n a_i X_i + c\right] = \sum_{i=1}^n a_i E[X_i] + c Linearity holds unconditionally, requiring no independence assumptions.

Variance, Covariance, and Independence

The variance measures dispersion: Var⁡(X)=E[(X−μ)2]=E[X2]−(E[X])2\operatorname{Var}(X) = E[(X - \mu)^2] = E[X^2] - (E[X])^2

  • Scaling: $\operatorname{Var}(aX + b) = a^2 \operatorname{Var}(X)$. Standard deviation is $\sigma = \sqrt{\operatorname{Var}(X)}$.

Covariance and Variance of Sums

The covariance is $\operatorname{Cov}(X, Y) = E[XY] - E[X]E[Y]$. Var⁡(X+Y)=Var⁡(X)+Var⁡(Y)+2Cov⁡(X,Y)\operatorname{Var}(X + Y) = \operatorname{Var}(X) + \operatorname{Var}(Y) + 2\operatorname{Cov}(X, Y) Var⁡(∑i=1nXi)=∑i=1nVar⁡(Xi)+2∑i<jCov⁡(Xi,Xj)\operatorname{Var}\left(\sum_{i=1}^n X_i\right) = \sum_{i=1}^n \operatorname{Var}(X_i) + 2 \sum_{i < j} \operatorname{Cov}(X_i, X_j)

  • Independence: If $X$ and $Y$ are independent, $\operatorname{Cov}(X, Y) = 0$, so $\operatorname{Var}(X + Y) = \operatorname{Var}(X) + \operatorname{Var}(Y)$.
  • Exam Alert: $\operatorname{Cov}(X, Y) = 0$ does not imply independence (e.g., $X \sim \text{Uniform}(-1, 1)$ and $Y = X^2$).

Catalogue of Common Distributions

DistributionTypePMF / PDFMean $E[X]$Variance $\operatorname{Var}(X)$Key Properties
Bernoulli($p$)Discrete$p^x (1-p)^{1-x}, x \in {0, 1}$$p$$p(1-p)$Single binary trial
Binomial($n, p$)Discrete$\binom{n}{k} p^k (1-p)^{n-k}$$np$$np(1-p)$Sum of $n$ i.i.d. Bernoulli
Geometric($p$)Discrete$(1-p)^{k-1} p, k \ge 1$$\frac{1}{p}$$\frac{1-p}{p^2}$Memoryless discrete trial count
Poisson($\lambda$)Discrete$\frac{\lambda^k e^{-\lambda}}{k!}, k \ge 0$$\lambda$$\lambda$Rare events limit of Binomial
Uniform($a, b$)Continuous$\frac{1}{b-a}, x \in [a, b]$$\frac{a+b}{2}$$\frac{(b-a)^2}{12}$Constant density
Exponential($\lambda$)Continuous$\lambda e^{-\lambda x}, x \ge 0$$\frac{1}{\lambda}$$\frac{1}{\lambda^2}$Memoryless continuous waiting time
Normal($\mu, \sigma^2$)Continuous$\frac{1}{\sigma\sqrt{2\pi}} e^{-\frac{(x-\mu)^2}{2\sigma^2}}$$\mu$$\sigma^2$Symmetric bell curve, CLT limit

Memoryless Property

Geometric and Exponential distributions uniquely satisfy $P(X > s + t \mid X > s) = P(X > t)$ for $s, t \ge 0$.


Tail Inequalities and Limit Theorems

  • Markov's Inequality: For $X \ge 0$ and $a > 0$, $P(X \ge a) \le \frac{E[X]}{a}$.
  • Chebyshev's Inequality: For finite variance $\sigma^2$, $P(|X - \mu| \ge \epsilon) \le \frac{\sigma^2}{\epsilon^2}$ or $P(|X - \mu| \ge k\sigma) \le \frac{1}{k^2}$.
  • Weak Law of Large Numbers (WLLN): For i.i.d. $X_i$ with mean $\mu$, sample mean $\bar{X}_n \xrightarrow{P} \mu$.
  • Central Limit Theorem (CLT): For i.i.d. $X_i$ with mean $\mu$ and variance $\sigma^2 \in (0, \infty)$: Zn=Xˉn−μσ/n→dN(0,1)Z_n = \frac{\bar{X}_n - \mu}{\sigma / \sqrt{n}} \xrightarrow{d} \mathcal{N}(0, 1)

Step-by-Step Worked Problem

Problem: A bin contains 50 lightbulbs, of which 10 are defective. If 5 bulbs are selected at random without replacement, let $X$ be the number of defective bulbs chosen. Find $E[X]$ and $\operatorname{Var}(X)$.

Solution:

  1. Indicator representation: Let $I_j = 1$ if the $j$-th drawn bulb is defective, and 0 otherwise ($j = 1, \dots, 5$). Then $X = \sum_{j=1}^5 I_j$.
  2. Expectation: By symmetry, $P(I_j = 1) = 10/50 = 1/5$. By linearity of expectation: E[X]=∑j=15E[Ij]=5×15=1E[X] = \sum_{j=1}^5 E[I_j] = 5 \times \frac{1}{5} = 1
  3. Variance components: Since $I_j^2 = I_j$, $\operatorname{Var}(I_j) = \frac{1}{5} - \frac{1}{25} = \frac{4}{25}$. For $j \neq k$, $P(I_j = 1, I_k = 1) = \frac{10}{50} \times \frac{9}{49} = \frac{9}{245}$. Cov⁡(Ij,Ik)=9245−(15)2=9245−125=−41225\operatorname{Cov}(I_j, I_k) = \frac{9}{245} - \left(\frac{1}{5}\right)^2 = \frac{9}{245} - \frac{1}{25} = -\frac{4}{1225}
  4. Summing variance: Var⁡(X)=5(425)+20(−41225)=45−16245=180245=3649\operatorname{Var}(X) = 5\left(\frac{4}{25}\right) + 20\left(-\frac{4}{1225}\right) = \frac{4}{5} - \frac{16}{245} = \frac{180}{245} = \frac{36}{49}

GRE Exam Traps & Pitfalls

Trap 1: Dropping $a^2$ in Variance Scaling Remember $\operatorname{Var}(aX + b) = a^2 \operatorname{Var}(X)$. Scalar constants pull out squared, while additive constants vanish. $\operatorname{Var}(-X) = \operatorname{Var}(X)$, never $-\operatorname{Var}(X)$.

Trap 2: Assuming Zero Covariance Implies Independence Zero covariance implies no linear relationship, but non-linear deterministic dependence (like $Y = X^2$ for symmetric $X$) still produces $\operatorname{Cov}(X, Y) = 0$.

Trap 3: Adding Variances of Dependent Variables $\operatorname{Var}(X + Y) = \operatorname{Var}(X) + \operatorname{Var}(Y)$ requires uncorrelatedness. Without it, the cross-term $2\operatorname{Cov}(X, Y)$ must be included.

Trap 4: Geometric Support Ambiguity Verify whether Geometric($p$) counts total trials ($k \in {1, 2, \dots}, E = 1/p$) or failures before success ($k \in {0, 1, \dots}, E = (1-p)/p$).

Loading diagram...
Distribution Hierarchy and Limiting Relationships
Test Your Knowledge

A deck of 10 distinct cards labeled 1 through 10 is randomly shuffled, so that all 10! permutations are equally likely. Let the random variable X denote the number of cards that remain in their original positions (i.e., card k is in position k). What are the expected value E[X] and variance Var(X)?

A
B
C
D
Test Your Knowledge

Let X be a random variable with mean mu = 20 and variance sigma^2 = 16. Using Chebyshev's inequality, what is the best possible upper bound on the probability P(|X - 20| >= 10)?

A
B
C
D
Test Your Knowledge

Let X be an exponentially distributed random variable with parameter lambda = 1/4 (so E[X] = 4). What is the conditional probability P(X > 10 | X > 6)?

A
B
C
D
Congratulations!

You've completed this section

Continue exploring other exams