概率论导论

Combinatorial analysis provides the mathematical framework for counting system configurations and outcomes without the need for exhaustive listing. This lesson introduces foundational techniques, including the Generalized Principle of Counting, recursive modeling, and the use of slack variables to solve constrained distribution problems.

This lesson introduces the fundamental concepts of probability theory, focusing on defining sample spaces as the set of all possible outcomes and events as specific subsets within that space. Students learn to categorize sample spaces as discrete or continuous and apply set theory and counting principles to calculate probabilities in various experimental contexts.

Conditional probability is a dynamic process of updating beliefs by restricting the sample space based on new information, defined by the formula $P(E|F) = P(EF)/P(F)$. This lesson explores how this mathematical framework allows us to refine likelihoods and avoid common logical errors, such as the Prosecutor's Fallacy, in real-world scenarios.

This lesson introduces discrete random variables as functions that map experimental outcomes to numerical values, enabling the use of summation to analyze probability. You will learn to define and verify Probability Mass Functions (PMFs) and use them to calculate the likelihood of specific events or ranges of outcomes.

This lesson introduces continuous random variables, explaining how they shift from discrete sums to integrals for calculating probabilities, expected values, and variance. Students learn to use probability density functions (PDFs) and cumulative distribution functions (CDFs) to model real-world phenomena and solve optimization problems.

This lesson introduces joint probability distributions, explaining how to model multiple random variables simultaneously using joint cumulative distribution functions and probability density functions. Students learn to analyze variable dependency, geometric constraints, and marginalization to understand how individual outcomes interact within a shared probability space.

This lesson introduces the principle of linearity of expectation, which allows for the calculation of the expected value of a sum of random variables by summing their individual expectations, regardless of their dependence. Students will learn to apply this powerful tool using indicator variables to simplify complex problems, analyze unbiased estimators like the sample mean, and understand the necessary convergence conditions for infinite series.

This lesson explores the Law of Averages, demonstrating how increasing sample sizes reduces individual volatility to reveal stable, predictable patterns. Students learn to quantify this stability using the signal-to-noise ratio and understand how probabilistic averages converge toward deterministic limits.

This lesson explores the dynamics of stochastic processes, focusing on Markovian state transitions and the Poisson process for modeling discrete arrivals over time. It also introduces Shannon entropy as a mathematical framework to quantify uncertainty and the information gain derived from random events.

This lesson introduces simulation as a powerful empirical method for estimating probabilities in complex systems where analytical solutions are mathematically intractable. By using indicator variables to track outcomes and applying the Strong Law of Large Numbers, we can use computational repetition to converge on accurate probability estimates.