ABSTRACT

Probability is the mathematical study of uncertainty and the likelihood of events occurring. This directory covers the transition from basic counting principles to complex distributions and analytical tools used to quantify random processes.


Knowledge Map

Laws of Probability

  • Focuses on the fundamental rules and logic used to calculate the likelihood of events within a sample space.
  • Covers Foundations (Uniform Probability, Sample Spaces), Independence, and Conditional Probabilities.
  • Includes Bayes’ Theorem as a primary tool for updating probabilities based on new evidence or observed data.
  • Essential for establishing the formal axioms required for rigorous statistical analysis.

Random Variables

  • Explores the functional mapping of experimental outcomes to numerical values .
  • Categorizes behavior through Distributions, distinguishing between Uniform (equally likely) and Non-Uniform (weighted) scenarios.
  • Details specific discrete models like the Binomial Distribution (counting successes) and the Geometric Distribution (trials until success).
  • Provides the structure needed to move from qualitative outcomes to quantitative data analysis.

Expected Values and Analysis

  • Targets the long-run average behavior and strategic decomposition of probabilistic systems.
  • Leverages the Linearity of Expectation to solve complex sums and Conditional Expectation to refine predictions.
  • Utilizes Case Analysis to partition sample spaces into manageable disjoint scenarios for solving multi-stage problems.
  • Bridges theoretical distributions with practical applications in Random Sampling and algorithmic performance.

Distribution Comparison

DistributionTypeKey CharacteristicTypical Use Case
UniformDiscreteEvery outcome has equal probability.Rolling a fair die.
BinomialDiscreteFixed trials, constant success.Number of heads in 10 flips.
GeometricDiscreteNumber of trials until first success.Flips needed to get the first head.

Core Theorems

Bayes’ Theorem

Used to update the probability of a hypothesis () given the presence of evidence ().

Linearity of Expectation

The expectation of a sum of random variables is equal to the sum of their individual expectations, regardless of whether they are independent.


  • Counting: Combinatorial foundations for building sample spaces.
  • Recursive Algorithms: Essential for analyzing “state-based” problems and trials-until-success scenarios.
  • Asymptotic Notation: Used to analyze the behavior of distributions and error bounds as .
Folder Contents

3 items under this folder.