Sampling Methods
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 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
Let the population be a finite set of labeled units , each carrying a value of a study variable. A sample is a subset, selected by a random mechanism described by a sampling design , where is the probability of drawing the particular subset . The first-order inclusion probability of unit is
and the second-order inclusion probability of the pair is
Derivation hint: each aggregates the design probabilities over all samples containing unit ; by convention.
The principal targets of estimation are the population total and population mean , with population variance :
Derivation hint: uses divisor so that the expected sample variance equals it under simple random sampling.
For any probability sampling design with for all , the Horvitz–Thompson (HT) estimator of the population total,
is unbiased: . Its variance is
Derivation hint: write and use and .
Under simple random sampling without replacement (SRSWOR) of size from , every unit has , and the sample mean is unbiased for with variance
The factor is the sampling fraction and is the finite population correction (FPC). Derivation hint: expand using , .
Why It Holds / Derivation
Step 1 — Indicator representation. Define the inclusion indicator . Then , where the sum now runs over the whole population because is zero outside .
Step 2 — Inclusion probabilities. By symmetry of SRSWOR, each unit is equally likely to be among the chosen, so . For a pair, the number of size- samples containing both is , giving .
Step 3 — Unbiasedness.
Step 4 — Variances and covariances of indicators. Since is Bernoulli, . The covariance is
Step 5 — Assemble.
Substituting and using together with , the algebra collapses to
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
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 encodes a comforting fact: as your sample approaches the whole forest (), uncertainty vanishes to zero, because you are converging on a census. The Horvitz–Thompson trick — dividing each observed value by its inclusion probability — is just bookkeeping: a tree sampled with probability "stands in" for 100 trees, so we weight it by 100 to rebuild the total.
Catalogue of Methods
- Simple Random Sampling (SRS): every subset of size equally likely; baseline design. With or without replacement.
- Systematic Sampling: choose a random start where , then take every -th unit. Inclusion probabilities .
- Stratified Sampling: partition into homogeneous strata of sizes ; sample within each independently. The stratified mean estimator is
with variance .
- 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 for an auxiliary size measure , improving efficiency when .
Derivation hint: equation [7] is a weighted average; its variance follows from independence across strata, so cross-stratum covariances vanish.
For stratified sampling with fixed total sample size , the allocation minimizing is
Strata that are larger or more internally variable receive proportionally more sample. Derivation hint: minimize subject to using a Lagrange multiplier; the optimum satisfies .
Worked Examples
Given: A town has households. An SRSWOR of households records monthly water use; the sample mean is and sample standard deviation .
Step 1 — Point estimate of mean. .
Step 2 — Estimate the variance of . Using as an estimate of :
Step 3 — Standard error. .
Step 4 — Estimate population total and its SE. ; .
Step 5 — 95% confidence interval for the mean (large-sample, ):
Given: A workforce of splits into stratum A (managers, , ) and stratum B (line workers, , ), measuring annual training hours. Total budget allows .
Step 1 — Compute the allocation weights.
Step 2 — Apply equation [8].
Step 3 — Compare with proportional allocation (): proportional would give , . Neyman shifts effort toward the small but highly variable managers.
Step 4 — Resulting stratified variance (ignoring FPC for brevity), , :
Common Misconceptions
The single most dangerous error is believing that more data fixes bad sampling. If the selection mechanism is correlated with (e.g., only volunteers respond), bias persists no matter how large 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 ; bias does not.
Systematic sampling (every -th unit) usually behaves like SRS, but if the population list has a hidden period equal to , the design can be disastrously biased. Suppose we audit daily sales by sampling every 7th day starting on a Monday: with we will only ever sample Mondays. If Monday sales systematically differ from the week's average, 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.
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 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
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
Historical Development
Subtleties & Limits
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 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 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