Every earlier topic in this unit computed exact probabilities from a fully specified model. This closing topic asks a different question: what happens to a sample average, or a sum of many independent pieces, as the sample size grows without bound? The answer — the law of large numbers in two forms (weak and strong), and the Central Limit Theorem — is the theoretical justification for treating a sample mean as a reliable estimate of a population mean, and for approximating almost any sum of independent contributions as normal, regardless of the individual pieces' own distribution. The topic opens with two general-purpose tail-probability bounds (Markov, Chebyshev) that require nothing beyond a mean and a variance, and closes with a worked Monte Carlo application that ties every idea in the unit — expectation, variance, the CLT — into a single practical estimation procedure.
By the end of this topic you should be able to:
- apply the Markov and Chebyshev inequalities to bound tail probabilities using only the mean and variance;
- state the weak law of large numbers and the precise meaning of convergence in probability;
- state the strong law of large numbers, define almost-sure convergence, and explain how it differs from convergence in probability;
- state the Central Limit Theorem and use the normal approximation to compute probabilities for a sum of many independent random variables;
- design and analyse a Monte Carlo estimator, including its standard error and a CLT-based confidence interval.
In this lesson
- Contents
- The big picture
The full lesson is for members.
Read the full lessonNew to SelfMadeQuant.com? See membership options or browse the Probability, Statistics and Financial Data syllabus.