pagesxyz
JobsCompaniesBlogResourcesCommunity
FeedbackContact
JobsCompaniesResourcesBlogContactFeedback

Foundations of Probability

  • What is Probability?
  • Theoretical vs Empirical Probability
  • Three Views of Probability
  • Sample Space and Events
  • Axioms of Probability
  • Independence and Expectation
  • Variance and Standard Deviation
  • Covariance and Correlation
  • Key Inequalities

Set Theory & Combinatorics

  • Set Operations in Probability
  • Counting Methods
  • Advanced Counting

Conditional & Bayesian Probability

  • Conditional Probability
  • Bayes' Theorem
  • Law of Total Probability

Random Variables & Distributions

  • What is a Random Variable?
  • Discrete vs Continuous
  • PDFs and CDFs
  • Expectation, Variance, and Moments

Discrete Distributions

  • Bernoulli and Binomial
  • Poisson and Geometric
  • Negative Binomial and Hypergeometric

Continuous Distributions

  • Uniform and Normal
  • Exponential, Gamma, Beta
  • Heavy-Tailed Distributions

Limit Theorems

  • Law of Large Numbers
  • Central Limit Theorem
  • Convergence in Probability vs Distribution

Frequentist Inference

  • Confidence Intervals
  • Hypothesis Testing
  • p-values and Statistical Decisions
  • Type I and Type II Errors
  • Power and Effect Size
  • Bootstrapping and Resampling

Advanced Probability Tools

  • Law of the Unconscious Statistician
  • Moment Generating Functions
  • Characteristic Functions
  • Markov Chains
  • Stationary Distributions

Bayesian Inference

  • Bayesian Philosophy
  • Prior, Likelihood, Posterior
  • Conjugate Priors
  • MCMC and Modern Computation

Regression Analysis

  • Ordinary Least Squares
  • Multiple Linear Regression
  • Regression Diagnostics
  • Regularization
  • Logistic and Generalized Linear Models

Multivariate Statistics

  • Joint, Marginal, and Conditional
  • Multivariate Normal
  • Covariance Matrices
  • Correlation vs Causation
  • Principal Component Analysis

Stochastic Processes

  • Random Walks
  • Poisson Processes
  • Brownian Motion
  • Itô's Lemma
  • Martingales
  • Geometric Brownian Motion

Simulation & Approximation

  • Monte Carlo Simulation
  • Variance Reduction
  • Bootstrapping for Finance
  • Quasi-Monte Carlo

Time Series

  • Stationarity and Autocorrelation
  • AR, MA, and ARIMA
  • GARCH and Volatility Clustering
  • Cointegration and Pairs Trading
  • Kalman Filters

Information Theory

  • Shannon Entropy
  • Kullback–Leibler Divergence
  • Mutual Information
  • Maximum Entropy

Linear Algebra

  • Vectors, Norms, and Inner Products
  • Matrix Operations
  • Eigenvalues and Eigenvectors
  • Singular Value Decomposition
  • Positive Definite Matrices
  • Numerical Stability

Calculus & Optimization

  • Multivariate Calculus
  • Lagrange Multipliers
  • Convex Optimization
  • Gradient Descent and Variants
  • Stochastic Calculus Primer

Machine Learning Fundamentals

  • Supervised vs Unsupervised
  • Bias–Variance Trade-off
  • Cross-Validation
  • Tree-Based Methods
  • Support Vector Machines
  • Clustering and Dimensionality Reduction
  • Classification Metrics

Deep Learning

  • Feedforward Networks
  • Backpropagation
  • Optimizers and Schedules
  • Regularization in DL
  • Architectures for Finance
  • Loss Functions

Options Pricing

  • Payoffs and Put–Call Parity
  • Risk-Neutral Valuation
  • Binomial Trees
  • Black–Scholes
  • The Greeks
  • Volatility Smile and Surface
  • Exotic Options

Portfolio Theory

  • Mean–Variance Optimization
  • CAPM and Factor Models
  • Sharpe, Sortino, and Information Ratio
  • Black–Litterman
  • Risk Parity

Trading & Risk Applications

  • Value-at-Risk
  • Expected Shortfall
  • Backtesting
  • Market Making Basics
  • Execution and Market Microstructure
  • Statistical Arbitrage
Study Guide/Limit Theorems
Section 7 · Lesson 7.26

Law of Large Numbers

Why sample averages converge to expectations as n grows.

The Law of Large Numbers (LLN) is the mathematical justification for "more data is better." For independent identically distributed random variables X1,X2,…X_1, X_2, \dotsX1​,X2​,… with finite mean μ\muμ, the sample average converges to μ\muμ:

Xˉn=1n∑i=1nXi→μas n→∞\bar{X}_n = \frac{1}{n}\sum_{i=1}^{n} X_i \to \mu \quad \text{as } n \to \inftyXˉn​=n1​i=1∑n​Xi​→μas n→∞

There are two flavors. The weak LLN says convergence holds in probability — for any ϵ>0\epsilon > 0ϵ>0, P(∣Xˉn−μ∣>ϵ)→0P(|\bar{X}_n - \mu| > \epsilon) \to 0P(∣Xˉn​−μ∣>ϵ)→0. The strong LLN says it holds almost surely — the random sequence converges with probability 111. The strong version is genuinely stronger; the weak follows from it.

LLN is what makes Monte Carlo simulation work, what justifies A/B testing, and what underpins empirical risk estimation. Average enough samples and you get the expectation, with the precision improving like 1/n1/\sqrt{n}1/n​ (per the CLT).

Watch out: LLN requires finite mean. For Cauchy and other distributions where E[X]E[X]E[X] doesn't exist, sample averages never stabilize — they keep jumping by orders of magnitude as nnn grows.

You estimate the mean of a distribution by averaging nnn samples. Roughly how does the standard error of the estimate shrink as nnn grows?

Previous
Heavy-Tailed Distributions
Next
Central Limit Theorem