Sampling Methods

⚡ Key Takeaways

Sampling methods are systematic procedures for selecting a subset (sample) from a larger population to estimate population characteristics. The key result: properly randomized sampling allows valid statistical inference with quantifiable error, regardless of population size. Used wherever exhaustive measurement is impossible — surveys, quality control, ecology, polling, and machine learning. Foundations laid by Bowley, Neyman, and Hansen in the early-to-mid 20th century.

💡 The Core Insight

The power of sampling comes not from the sample being "representative" by appearance, but from the randomization of selection. Because each unit's inclusion probability is known by design, we can mathematically reweight the observed data to reconstruct the population total or mean without bias, and we can quantify how much our estimate would vary across hypothetical repetitions of the sampling process. Randomness in selection, not in nature, is what licenses the inference.

Formal Statement

DefinitionPopulation, Sample, and Inclusion Probability

Let the population be a finite set of NN labeled units U={1,2,…,N}\mathcal{U} = \{1, 2, \dots, N\}, each carrying a value yiy_i of a study variable. A sample S⊆US \subseteq \mathcal{U} is a subset, selected by a random mechanism described by a sampling design p(⋅)p(\cdot), where p(S)p(S) is the probability of drawing the particular subset SS. The first-order inclusion probability of unit ii is

1
πi=Pr⁡(i∈S)=∑S∋ip(S),\quad \pi_i = \Pr(i \in S) = \sum_{S \ni i} p(S),

and the second-order inclusion probability of the pair (i,j)(i,j) is

2
πij=Pr⁡(i∈S and j∈S)=∑S⊇{i,j}p(S).\quad \pi_{ij} = \Pr(i \in S \text{ and } j \in S) = \sum_{S \supseteq \{i,j\}} p(S).

Derivation hint: each πi\pi_i aggregates the design probabilities over all samples containing unit ii; πii=πi\pi_{ii} = \pi_i by convention.

DefinitionPopulation Parameters and the Sample Mean

The principal targets of estimation are the population total TT and population mean Yˉ\bar{Y}, with population variance S2S^2:

3
T=∑i=1Nyi,Yˉ=1N∑i=1Nyi,S2=1N−1∑i=1N(yi−Yˉ)2.\quad T = \sum_{i=1}^{N} y_i, \qquad \bar{Y} = \frac{1}{N}\sum_{i=1}^{N} y_i, \qquad S^2 = \frac{1}{N-1}\sum_{i=1}^{N}\left(y_i - \bar{Y}\right)^2.

Derivation hint: S2S^2 uses divisor N−1N-1 so that the expected sample variance equals it under simple random sampling.

TheoremHorvitz–Thompson Estimator

For any probability sampling design with πi>0\pi_i > 0 for all ii, the Horvitz–Thompson (HT) estimator of the population total,

4
T^HT=∑i∈Syiπi,\quad \hat{T}_{HT} = \sum_{i \in S} \frac{y_i}{\pi_i},

is unbiased: E[T^HT]=T\mathbb{E}[\hat{T}_{HT}] = T. Its variance is

5
Var(T^HT)=∑i=1N∑j=1N(πij−πiπj)yiπiyjπj.\quad \mathrm{Var}(\hat{T}_{HT}) = \sum_{i=1}^{N}\sum_{j=1}^{N} \left(\pi_{ij} - \pi_i \pi_j\right)\frac{y_i}{\pi_i}\frac{y_j}{\pi_j}.

Derivation hint: write T^HT=∑i(yi/πi) 1[i∈S]\hat{T}_{HT} = \sum_i (y_i/\pi_i)\,\mathbb{1}[i\in S] and use E[1[i∈S]]=πi\mathbb{E}[\mathbb{1}[i\in S]] = \pi_i and E[1[i∈S]1[j∈S]]=πij\mathbb{E}[\mathbb{1}[i\in S]\mathbb{1}[j\in S]] = \pi_{ij}.

TheoremSimple Random Sampling Without Replacement: Mean and Variance

Under simple random sampling without replacement (SRSWOR) of size nn from NN, every unit has πi=n/N\pi_i = n/N, and the sample mean yˉ=1n∑i∈Syi\bar{y} = \frac{1}{n}\sum_{i\in S} y_i is unbiased for Yˉ\bar{Y} with variance

6
Var(yˉ)=S2n(1−nN).\quad \mathrm{Var}(\bar{y}) = \frac{S^2}{n}\left(1 - \frac{n}{N}\right).

The factor f=n/Nf = n/N is the sampling fraction and (1−n/N)(1 - n/N) is the finite population correction (FPC). Derivation hint: expand Var(yˉ)=1n2[∑iVar(1i)yi2+∑i≠jCov(1i,1j)yiyj]\mathrm{Var}(\bar y) = \frac{1}{n^2}\big[\sum_i \mathrm{Var}(\mathbb 1_i)y_i^2 + \sum_{i\neq j}\mathrm{Cov}(\mathbb 1_i,\mathbb 1_j)y_iy_j\big] using πi=n/N\pi_i = n/N, πij=n(n−1)N(N−1)\pi_{ij} = \frac{n(n-1)}{N(N-1)}.

Why It Holds / Derivation

ProofUnbiasedness and Variance of the Sample Mean under SRSWOR

Step 1 — Indicator representation. Define the inclusion indicator ai=1[i∈S]a_i = \mathbb{1}[i \in S]. Then yˉ=1n∑i=1Naiyi\bar{y} = \frac{1}{n}\sum_{i=1}^{N} a_i y_i, where the sum now runs over the whole population because aia_i is zero outside SS.

Step 2 — Inclusion probabilities. By symmetry of SRSWOR, each unit is equally likely to be among the nn chosen, so E[ai]=πi=n/N\mathbb{E}[a_i] = \pi_i = n/N. For a pair, the number of size-nn samples containing both is (N−2n−2)\binom{N-2}{n-2}, giving πij=(N−2n−2)/(Nn)=n(n−1)N(N−1)\pi_{ij} = \binom{N-2}{n-2}/\binom{N}{n} = \frac{n(n-1)}{N(N-1)}.

Step 3 — Unbiasedness.

E[yˉ]=1n∑i=1NE[ai] yi=1n⋅nN∑i=1Nyi=Yˉ.\mathbb{E}[\bar{y}] = \frac{1}{n}\sum_{i=1}^{N} \mathbb{E}[a_i]\,y_i = \frac{1}{n}\cdot\frac{n}{N}\sum_{i=1}^{N} y_i = \bar{Y}.

Step 4 — Variances and covariances of indicators. Since aia_i is Bernoulli, Var(ai)=πi(1−πi)=nN(1−nN)\mathrm{Var}(a_i) = \pi_i(1-\pi_i) = \frac{n}{N}\left(1-\frac{n}{N}\right). The covariance is

Cov(ai,aj)=πij−πiπj=n(n−1)N(N−1)−n2N2=−nN⋅N−nN2(N−1)⋅N=−1N−1 nN(1−nN).\mathrm{Cov}(a_i,a_j) = \pi_{ij} - \pi_i\pi_j = \frac{n(n-1)}{N(N-1)} - \frac{n^2}{N^2} = -\frac{n}{N}\cdot\frac{N-n}{N^2(N-1)}\cdot N = -\frac{1}{N-1}\,\frac{n}{N}\Big(1-\frac{n}{N}\Big).

Step 5 — Assemble.

Var(yˉ)=1n2[∑iyi2Var(ai)+∑i≠jyiyjCov(ai,aj)].\mathrm{Var}(\bar{y}) = \frac{1}{n^2}\left[\sum_i y_i^2 \mathrm{Var}(a_i) + \sum_{i\neq j} y_i y_j \mathrm{Cov}(a_i,a_j)\right].

Substituting and using ∑i≠jyiyj=T2−∑iyi2\sum_{i\neq j} y_i y_j = T^2 - \sum_i y_i^2 together with ∑i(yi−Yˉ)2=(N−1)S2\sum_i (y_i - \bar Y)^2 = (N-1)S^2, the algebra collapses to

Var(yˉ)=S2n(1−nN).■\mathrm{Var}(\bar{y}) = \frac{S^2}{n}\left(1 - \frac{n}{N}\right). \qquad \blacksquare
∎
mathematician · Jerzy Neyman | 1894–1981

A Polish-American mathematician and statistician, Neyman transformed survey sampling from a debated art into a rigorous theory. His landmark 1934 paper On the Two Different Aspects of the Representative Method established the superiority of randomized (probability) sampling over purposive selection and introduced confidence intervals and optimal allocation in stratified sampling. Working at University College London and later Berkeley, he founded one of the most influential statistics departments in the world. His "representative method" framework underlies essentially all modern survey practice.

Building Intuition

🧠 Intuition

Think of estimating the average height of trees in a vast forest. You cannot measure every tree, so you wander in and measure some. If you measure only the tall, easy-to-reach ones near the road, your estimate is biased upward — no amount of arithmetic fixes a selection problem. But if you place a grid over a map and visit randomly chosen cells, then even though any single sample might happen to catch unusually tall or short trees, the procedure has no systematic lean. The FPC term (1−n/N)(1 - n/N) encodes a comforting fact: as your sample approaches the whole forest (n→Nn \to N), uncertainty vanishes to zero, because you are converging on a census. The Horvitz–Thompson trick — dividing each observed value by its inclusion probability πi\pi_i — is just bookkeeping: a tree sampled with probability 1/1001/100 "stands in" for 100 trees, so we weight it by 100 to rebuild the total.

Figure
Sampling design hierarchy: how units flow from population to estimate
Population (N units) → Design p(S) → Sample (n units) → Estimate Population U π_i = n/N Sample S y_i / π_i T̂ = Σ y_i/π_i unbiased estimate Var(ȳ) vs n (FPC effect) n →

Catalogue of Methods

DefinitionMajor Probability Sampling Designs
  • Simple Random Sampling (SRS): every subset of size nn equally likely; baseline design. With or without replacement.
  • Systematic Sampling: choose a random start r∈{1,…,k}r \in \{1,\dots,k\} where k=N/nk = N/n, then take every kk-th unit. Inclusion probabilities πi=1/k=n/N\pi_i = 1/k = n/N.
  • Stratified Sampling: partition U\mathcal{U} into HH homogeneous strata of sizes NhN_h; sample nhn_h within each independently. The stratified mean estimator is
7
yˉst=∑h=1HWh yˉh,Wh=NhN,\quad \bar{y}_{st} = \sum_{h=1}^{H} W_h\,\bar{y}_h, \qquad W_h = \frac{N_h}{N},

with variance Var(yˉst)=∑hWh2Sh2nh(1−nhNh)\mathrm{Var}(\bar{y}_{st}) = \sum_h W_h^2 \frac{S_h^2}{n_h}\left(1 - \frac{n_h}{N_h}\right).

  • Cluster Sampling: sample whole groups (clusters) and measure all units within them; cheaper but usually less precise per unit.
  • Multistage Sampling: combine the above hierarchically (e.g., sample districts, then households, then persons).
  • Probability Proportional to Size (PPS): set πi∝xi\pi_i \propto x_i for an auxiliary size measure xix_i, improving efficiency when yi≈βxiy_i \approx \beta x_i.

Derivation hint: equation [7] is a weighted average; its variance follows from independence across strata, so cross-stratum covariances vanish.

TheoremNeyman Optimal Allocation

For stratified sampling with fixed total sample size n=∑hnhn = \sum_h n_h, the allocation minimizing Var(yˉst)\mathrm{Var}(\bar{y}_{st}) is

8
nh=n⋅NhSh∑k=1HNkSk.\quad n_h = n \cdot \frac{N_h S_h}{\sum_{k=1}^{H} N_k S_k}.

Strata that are larger or more internally variable receive proportionally more sample. Derivation hint: minimize ∑hWh2Sh2/nh\sum_h W_h^2 S_h^2/n_h subject to ∑hnh=n\sum_h n_h = n using a Lagrange multiplier; the optimum satisfies nh∝WhSh∝NhShn_h \propto W_h S_h \propto N_h S_h.

Worked Examples

ExampleSRSWOR Mean and Its Standard Error

Given: A town has N=4,000N = 4{,}000 households. An SRSWOR of n=100n = 100 households records monthly water use; the sample mean is yˉ=18.0 m3\bar{y} = 18.0\text{ m}^3 and sample standard deviation s=6.0 m3s = 6.0\text{ m}^3.

Step 1 — Point estimate of mean. Yˉ^=yˉ=18.0 m3\hat{\bar{Y}} = \bar{y} = 18.0\text{ m}^3.

Step 2 — Estimate the variance of yˉ\bar y. Using s2=36s^2 = 36 as an estimate of S2S^2:

Var^(yˉ)=s2n(1−nN)=36100(1−1004000)=0.36×0.975=0.351.\widehat{\mathrm{Var}}(\bar{y}) = \frac{s^2}{n}\left(1 - \frac{n}{N}\right) = \frac{36}{100}\left(1 - \frac{100}{4000}\right) = 0.36 \times 0.975 = 0.351.

Step 3 — Standard error. SE(yˉ)=0.351=0.592 m3\mathrm{SE}(\bar y) = \sqrt{0.351} = 0.592\text{ m}^3.

Step 4 — Estimate population total and its SE. T^=Nyˉ=4000×18.0=72,000 m3\hat{T} = N\bar y = 4000 \times 18.0 = 72{,}000\text{ m}^3; SE(T^)=N×SE(yˉ)=4000×0.592=2,369 m3\mathrm{SE}(\hat T) = N \times \mathrm{SE}(\bar y) = 4000 \times 0.592 = 2{,}369\text{ m}^3.

Step 5 — 95% confidence interval for the mean (large-sample, z=1.96z = 1.96):

18.0±1.96×0.592=18.0±1.16.18.0 \pm 1.96 \times 0.592 = 18.0 \pm 1.16.
Yˉ∈(16.84, 19.16) m3,T^=72,000±4,644 m3\boxed{\bar{Y} \in (16.84,\ 19.16)\ \text{m}^3, \quad \hat T = 72{,}000 \pm 4{,}644\ \text{m}^3}
ExampleNeyman Allocation Across Two Strata

Given: A workforce of N=1,000N = 1{,}000 splits into stratum A (managers, NA=200N_A = 200, SA=12S_A = 12) and stratum B (line workers, NB=800N_B = 800, SB=4S_B = 4), measuring annual training hours. Total budget allows n=100n = 100.

Step 1 — Compute the allocation weights.

NASA=200×12=2400,NBSB=800×4=3200,sum=5600.N_A S_A = 200 \times 12 = 2400, \qquad N_B S_B = 800 \times 4 = 3200, \qquad \text{sum} = 5600.

Step 2 — Apply equation [8].

nA=100×24005600=42.9≈43,nB=100×32005600=57.1≈57.n_A = 100 \times \frac{2400}{5600} = 42.9 \approx 43, \qquad n_B = 100 \times \frac{3200}{5600} = 57.1 \approx 57.

Step 3 — Compare with proportional allocation (nh=nWhn_h = n W_h): proportional would give nA=20n_A = 20, nB=80n_B = 80. Neyman shifts effort toward the small but highly variable managers.

Step 4 — Resulting stratified variance (ignoring FPC for brevity), WA=0.2W_A = 0.2, WB=0.8W_B = 0.8:

Var(yˉst)=(0.2)214443+(0.8)21657=0.04×3.35+0.64×0.281=0.134+0.180=0.314.\mathrm{Var}(\bar y_{st}) = (0.2)^2\frac{144}{43} + (0.8)^2\frac{16}{57} = 0.04\times3.35 + 0.64\times0.281 = 0.134 + 0.180 = 0.314.
nA=43,nB=57,Var(yˉst)≈0.314\boxed{n_A = 43,\quad n_B = 57,\quad \mathrm{Var}(\bar y_{st}) \approx 0.314}

Common Misconceptions

⚠️ A large sample does not cure selection bias

The single most dangerous error is believing that more data fixes bad sampling. If the selection mechanism is correlated with yy (e.g., only volunteers respond), bias persists no matter how large nn grows. The 1936 Literary Digest poll surveyed 2.4 million people yet predicted Landon would defeat Roosevelt — Roosevelt won in a landslide — because the sample was drawn from car and telephone owners, who skewed wealthy during the Depression. A randomized sample of a few thousand would have been far more accurate. Precision shrinks with nn; bias does not.

CounterexampleSystematic sampling can fail catastrophically with periodicity

Systematic sampling (every kk-th unit) usually behaves like SRS, but if the population list has a hidden period equal to kk, the design can be disastrously biased. Suppose we audit daily sales by sampling every 7th day starting on a Monday: with k=7k = 7 we will only ever sample Mondays. If Monday sales systematically differ from the week's average, yˉ\bar{y} is biased and its variance estimate (built assuming SRS-like behavior) is misleadingly small. The list order interacting with the step size — not randomness — produces the failure.

⚠️ The sample variance s2/ns^2/n formula assumes randomization, not "typical-looking" data

Confidence intervals are valid because the selection was randomized, which makes the estimator's sampling distribution computable. They are not justified by the sample "looking representative." Applying the formula s2/ns^2/n to a convenience sample (e.g., the first 100 people who walked by) produces a number with the right units but no inferential meaning — the implied population is undefined and the coverage probability is unknown.

Connections

connection

Sampling theory sits at the crossroads of probability and inference. The finite-population framework here contrasts with the infinite-population (model-based) view in Statistical Inference, where data are treated as i.i.d. draws from an assumed distribution rather than units of a fixed list. The unbiasedness and variance results rest on Expectation and Variance of indicator random variables. Large-sample confidence intervals invoke the Central Limit Theorem, adapted to without-replacement designs. Stratification and ratio estimation connect to Analysis of Variance (partitioning variability into within- and between-group components) and to Linear Regression through auxiliary-variable methods. The Monte Carlo "sampling" of distributions in computational statistics — Monte Carlo Methods and Markov Chain Monte Carlo — is a conceptual cousin: there one samples from a known distribution to estimate integrals, whereas survey sampling reconstructs an unknown finite population.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- 1895 — Anders Kiaer (Norway) proposes the "representative method," advocating partial enumeration over full census, sparking international debate.
- 1906 — Arthur Bowley gives the first rigorous treatment of random sampling and standard errors for social surveys in Britain.
- 1925 — The International Statistical Institute formally endorses the representative method after years of controversy.
- 1934 — Jerzy Neyman's foundational paper distinguishes random from purposive sampling, introduces stratified sampling theory, optimal allocation, and confidence intervals.
- 1936 — The Literary Digest fiasco vs. George Gallup's small scientific sample dramatizes the superiority of probability sampling to mass convenience samples.
- 1943 — Mahalanobis develops large-scale survey methods (and pilot/cost studies) at the Indian Statistical Institute.
- 1949 — Hansen and Hurwitz formalize unequal-probability (PPS) sampling and the theory of multistage designs at the U.S. Census Bureau.
- 1952 — Horvitz and Thompson publish their general unbiased estimator for arbitrary inclusion probabilities, unifying the field.
- 1977 — Leslie Kish's Survey Sampling and Cochran's Sampling Techniques (3rd ed.) become the canonical undergraduate/graduate references.

Subtleties & Limits

open-problem · Nonresponse, frame errors, and the limits of design-based inference

Classical sampling theory assumes a perfect sampling frame (an accurate list of all units) and full response. In practice, frames are incomplete (undercoverage), units overlap or duplicate, and nonresponse is rarely random — those who decline often differ systematically from those who answer. The HT estimator's unbiasedness collapses when πi\pi_i is not truly known because some units are unreachable. Adjustments — weighting classes, calibration, raking, and model-assisted estimators — partly repair this but reintroduce modeling assumptions, blurring the clean design-based / model-based distinction. With the decline of telephone landlines and the rise of nonprobability online panels, a live methodological frontier is whether well-calibrated nonprobability samples, paired with auxiliary data and statistical models, can match probability samples — a question without consensus. Estimating second-order inclusion probabilities πij\pi_{ij} for complex designs, needed for valid variance estimation, also remains computationally and theoretically delicate, motivating resampling methods (jackknife, bootstrap for survey data).

See Also

Statistical Inference · Central Limit Theorem · Stratified Sampling · Monte Carlo Methods · Experimental Design · Confidence Intervals · Bootstrap and Resampling · Probability Theory