Overview
The Laws of Large Numbers describe how sample averages of random variables stabilize around an expected value as the sample size grows. The Weak Laws establish convergence in probability under successively weaker hypotheses; the Strong Law strengthens this to almost sure convergence. Renewal Theory and the Glivenko–Cantelli Theorem are close relatives where the same averaging principle controls more elaborate objects (renewal counts, empirical distribution functions).
Key topics
Section titled “Key topics”- Weak LLN 1: Variance-based WLLNs. Uncorrelated sequences with uniformly bounded variances, plus two triangular-array versions (one with finite variance, one for heavy-tailed entries via truncation).
- Weak LLN 2: i.i.d. WLLN under the tail condition , centered by the truncated mean. Reduces to the triangular-array truncation theorem from WLLN 1.
- Weak LLN 3: The classical i.i.d. WLLN. Finite mean is enough for . The most commonly invoked form of the WLLN.
- Strong LLN: Etemadi’s a.s. convergence theorem under identical distribution, pairwise independence, and finite mean. Proved via truncation, a geometric subsequence, and a sandwich argument.
- Renewal Theory: For i.i.d. positive interarrival times with mean , the counting process satisfies .
- Glivenko–Cantelli Theorem: The “Fundamental Theorem of Statistics”. The empirical distribution function converges to the true distribution function uniformly and almost surely.
How the pieces fit together
Section titled “How the pieces fit together”The three weak laws form a chain of relaxing hypotheses:
Each is proved by reducing to the previous one. The Strong LLN sits above the WLLNs: it strengthens the conclusion of WLLN 3 (convergence in probability almost sure) under the same hypotheses, at the cost of a much harder proof. Renewal Theory and Glivenko–Cantelli are corollaries of the SLLN applied to derived random variables (interarrival sums; indicators of the form ).