Probability

6 articles 0 subfields 9 topics

Articles in This Field

Measure-Theoretic Probability: σ-Algebras, Random Variables, and Expectation as an Integral
Probability theory becomes conceptually complete when it is formulated as measure theory with total mass one. The benefit is not abstraction for its own sake. The measure-theoretic framework tells you exactly which sets can be assigned probabilities without contradiction, which functions can be treated as random variables, and why the operations that dominate probability—limits, conditioning, […]
Martingales and Stopping Times: Optional Stopping, Maximal Inequalities, and Convergence Machinery
Martingales are the most efficient language for “no predictable drift.” They formalize fair games, but their reach is broader: they govern many stochastic processes, provide clean proofs of limit theorems, and yield sharp bounds on fluctuations. The power of martingales comes from two facts. First, the defining identity is conditional: it tracks what can be […]
Characteristic Functions and Weak Convergence: Proving the Central Limit Theorem by Analytic Limits
Convergence in distribution is the basic language of limit laws. It is weak enough to describe asymptotic shapes of random variables without requiring a pointwise coupling, yet strong enough to support stable consequences such as convergence of probabilities of continuity sets and convergence of expectations of bounded continuous test functions. The most direct tool for […]
A Counterexample That Teaches Probability Better Than a Lecture
Probability feels intuitive until you try to make a single sentence precise. The fastest way to learn what the definitions really mean is to watch one plausible inference fail in a clean, controlled setting. Counterexamples do not just refute; they expose the boundary of a concept, and they teach you how to reason without importing […]
Common Mistakes in Probability and How to Avoid Them
Probability is unforgiving in a helpful way: a statement is either true under stated assumptions or it is not. Many mistakes come from skipping the assumptions that make a familiar identity valid. The fastest way to become reliable is to learn the standard failure modes and the correct replacement moves. This article collects frequent mistakes […]
Computing with Probability: What Survives Discretization
Probability lives in a world of measures on large spaces. Computing lives in a world of finite objects: floating-point numbers, arrays, finite graphs, finite random seeds. Almost every computational workflow in probability is a discretization, even when you do not call it that. The interesting question is not whether discretization changes things. It always changes […]

Subfields

No subfields yet.

Study Topics

Related Topics