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/Advanced Probability Tools
Section 9 · Lesson 9.36

Moment Generating Functions

A transform that uniquely identifies a distribution and makes sums easy.

The moment generating function (MGF) of XXX is

MX(t)=E[etX]M_X(t) = E[e^{tX}]MX​(t)=E[etX]

defined wherever this expectation is finite in a neighborhood of 000. When it exists, the MGF uniquely determines the distribution.

Three properties make MGFs powerful:

  • The kkk-th moment is the kkk-th derivative at zero: E[Xk]=MX(k)(0)E[X^k] = M_X^{(k)}(0)E[Xk]=MX(k)​(0).
  • For independent XXX and YYY, the MGF of the sum is the product: MX+Y(t)=MX(t) MY(t)M_{X + Y}(t) = M_X(t)\, M_Y(t)MX+Y​(t)=MX​(t)MY​(t).
  • Convergence of MGFs implies convergence in distribution.

Some closed forms worth knowing:

MN(μ,σ2)(t)=exp⁡ ⁣(μt+σ2t22),MPoisson(λ)(t)=exp⁡(λ(et−1))M_{N(\mu, \sigma^2)}(t) = \exp\!\left(\mu t + \frac{\sigma^2 t^2}{2}\right), \qquad M_{\mathrm{Poisson}(\lambda)}(t) = \exp(\lambda(e^t - 1))MN(μ,σ2)​(t)=exp(μt+2σ2t2​),MPoisson(λ)​(t)=exp(λ(et−1))

The product rule for sums makes MGFs the standard tool for proving the CLT, deriving distributions of sums, and most other classical limit results.

If X∼N(0,1)X \sim N(0, 1)X∼N(0,1) and Y∼N(0,1)Y \sim N(0, 1)Y∼N(0,1) are independent, what's the MGF of X+YX + YX+Y?

Previous
Law of the Unconscious Statistician
Next
Characteristic Functions