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/Discrete Distributions
Section 5 · Lesson 5.22

Negative Binomial and Hypergeometric

Waiting for k successes, and sampling without replacement.

Two more discrete distributions for problems where the simple Bernoulli/Binomial model isn't quite right.

The Negative Binomial(r,p)(r, p)(r,p) counts the number of trials until the rrr-th success in independent Bernoulli(p)(p)(p) trials:

P(X=k)=(k−1r−1)pr(1−p)k−r,k=r,r+1,…P(X = k) = \binom{k-1}{r-1} p^r (1-p)^{k-r}, \quad k = r, r+1, \dotsP(X=k)=(r−1k−1​)pr(1−p)k−r,k=r,r+1,…

with E[X]=r/pE[X] = r/pE[X]=r/p. It generalizes the Geometric, which is the r=1r = 1r=1 case. Useful whenever you care about the time to the rrr-th event rather than just the first.

The Hypergeometric models drawing nnn items without replacement from a population of NNN containing KKK successes:

P(X=k)=(Kk)(N−Kn−k)(Nn)P(X = k) = \frac{\binom{K}{k}\binom{N-K}{n-k}}{\binom{N}{n}}P(X=k)=(nN​)(kK​)(n−kN−K​)​

Without replacement matters when the population is small. As N→∞N \to \inftyN→∞ with K/NK/NK/N fixed, the Hypergeometric converges to the Binomial(n,K/N)(n, K/N)(n,K/N) — large populations look effectively independent.

Use Hypergeometric for card hands, ball-and-urn problems, audit sampling, and survey sampling from finite populations.

An urn has 5 red and 5 blue balls. You draw 3 without replacement. What is the probability all 3 are red?

Previous
Poisson and Geometric
Next
Uniform and Normal