
This lecture builds the idea of “measure” from the ground up. Starting with length on intervals, it explains how we assign a consistent notion of size to sets on the real line. You’ll see why finite additivity isn’t enough, why countable additivity shows up naturally, and how this leads to Lebesgue measure. The focus is intuition and clean definitions, so measure theory feels approachable before we use it in probability and stochastic processes.
This lecture explains why we need σ-algebras before we can talk about measures or probability. It introduces σ-algebras as collections of sets that are stable under complements and countable unions, so limits and logical operations behave well. You’ll see how measurable spaces are defined, how Borel sets arise on ℝ, and why measurability is the key condition behind random variables and distributions. The goal is to make the structure feel natural, not abstract for its own sake.
This lecture sets up probability in a precise but intuitive way. It defines probability spaces, events, and random variables using the language of measures and σ-algebras. You’ll see how discrete and continuous models fit into the same framework, how distributions are defined through pushforward measures, and why measurability matters. Concrete examples like coins, dice, uniform variables, and the normal distribution are used to connect the formal setup to calculations you already recognize.
This lecture introduces expectation, conditioning, and independence as the core tools of probability. It explains expectation as an average via integration, shows how variance measures spread, and builds conditional probability and conditional expectation as ways to update information. Independence is presented both conceptually and algebraically, highlighting why it simplifies calculations. These ideas form the backbone of stochastic processes and set up how information evolves over time in stochastic calculus.
This lecture introduces stochastic processes as time-indexed collections of random variables and explains how information evolves through filtrations. It covers adapted processes, martingales as “fair games,” and why conditioning plays a central role over time. The lecture then builds intuition for Brownian motion, including its defining properties, connection to random walks, and why its variance grows linearly in time. These ideas set the conceptual groundwork for stochastic integrals, Itô calculus, and stochastic differential equations.
This lecture introduces stochastic integrals and explains why ordinary calculus does not work for Brownian motion. It builds the Itô integral step by step, starting from simple adapted processes and extending to general integrands. You’ll see how non-anticipation is enforced, why left endpoints matter, and how the Itô isometry provides a clean variance identity that makes everything well-defined. This result is the main technical tool behind stochastic calculus and sets up Itô’s lemma and stochastic differential equations.
This lecture develops Itô’s lemma for time-dependent functions in one dimension and shows how it acts as the correct chain rule for stochastic processes. It explains where the extra second-derivative term comes from and how to use Itô’s formula in practice. Several reusable templates are introduced, including squaring Brownian motion, exponential martingales, drift-removal tricks, and log transforms for multiplicative noise.
This lecture explains quadratic variation and why it is the key reason stochastic calculus differs from ordinary calculus. It shows how Brownian motion accumulates variance over time, leading to rules like (dW)2=dt(dW)^2 = dt(dW)2=dt. Using this idea, the lecture connects quadratic variation to Itô’s formula and then applies these tools to solve common stochastic differential equations, including additive noise, geometric Brownian motion, and linear SDEs, using clear, reusable solution templates.
This lecture applies stochastic calculus to finance through the Black–Scholes model. It shows how modeling stock prices with geometric Brownian motion, applying Itô’s lemma, and enforcing no-arbitrage lead directly to the Black–Scholes PDE. You’ll see how delta hedging removes randomness, why the option price depends on volatility and interest rates but not the stock’s expected return, and how the pricing formula follows from a clean, reusable SDE-based argument rather than memorization.
This lecture introduces mean reversion through the Ornstein–Uhlenbeck process, a core model for systems that fluctuate randomly but are pulled back toward a baseline. It walks through the OU SDE, explains how it differs from Brownian motion, and solves it explicitly using an integrating factor. You’ll see how the mean returns to a long-run level, why the variance stabilizes instead of growing, and how this model naturally appears in neuroscience, physics, and engineering settings where noise and feedback coexist.
This course is a first introduction to stochastic calculus, focused on learning how to solve stochastic differential equations—the kind of equations you use when something changes over time with randomness or probability.
We’ll keep things clear and steady: you’ll learn the core concepts of stochastic calculus with many practice problems and guided examples that build confidence step by step. I’ll assume you already have basic calculus, and I’ll provide the probability background you need as we go, so you’re never left guessing what a definition means or why a method works. The goal isn’t to drown you in jargon—it’s to make the ideas feel usable.
As we proceed, I’ll demonstrate how stochastic differential equations show up in real situations—such as finance (modeling price movement and risk), neuroscience (capturing noisy signals and fluctuating activity), and computer science (understanding randomness in learning, simulation, and noisy systems). You’ll see how the same core tools can describe very different problems, and you’ll practice translating a story about a system into an equation you can actually work with.
By the end, you should feel comfortable reading SDEs, solving common models, and understanding what the solutions are telling you—both mathematically and intuitively—so you can apply these ideas in future courses, research, or projects.