Stochastic Processes
A stochastic process is a mathematical object defined as a collection of random variables defined on a common probability space , indexed by a totally ordered set (usually representing time). Formally, a stochastic process is parameterized as , where for each , is an -measurable function mapping for measurable state space .
When or , the process is cast as a discrete-time stochastic process. If or , it represents a continuous-time stochastic process. The state space determines whether the process is discrete-state (e.g., integer values) or continuous-state (e.g., real-valued).
Filtrations and Information
To rigorously describe the evolution of a stochastic process, it is essential to capture the accumulation of information over time. This is formalized by a filtration , which is an increasing family of sub--algebras of . That is, for all .
The intuitive interpretation of is the “history” or the “available information” up to time . A stochastic process is said to be adapted to the filtration if, for every , the random variable is -measurable. This implies that if one observes the state of the universe up to time , the value of is completely known.
Martingales
Martingales constitute one of the most fundamental classes of stochastic processes, generalizing the concept of a “fair game” where knowledge of past events never helps predict expected future winnings.
Let be a filtered probability space. A real-valued stochastic process is a martingale with respect to the filtration and probability measure if it satisfies the following three conditions:
- Adaptedness: is -measurable for all .
- Integrability: for all (i.e., ).
- Martingale Property: For all , the conditional expectation satisfies:
If the equality in the third condition is replaced with (or ), the process is termed a supermartingale (or submartingale). In a supermartingale, the expected future value is less than or equal to the current value (a losing game), whereas in a submartingale, it is greater than or equal to the current value (a winning game).
Discrete-Time Martingales
Consider a simple symmetric random walk , where the increments are independent, identically distributed (i.i.d.) random variables with and . Let be the natural filtration. Check that is a martingale:
Since is -measurable, . Since is independent of , . Thus, , proving is a discrete-time martingale.
Let $M_t$ be a martingale. Which of the following statements strictly describes its conditional expectation characteristic?
Stopping Times
In many practical and theoretical contexts, we are interested in evaluating models at random times (e.g., the time a stock hits a certain price or the time a gambler goes bankrupt). This gives rise to the concept of a stopping time.
A random variable is a stopping time (or Markov time) with respect to a filtration if, for every , the event . Intuitively, at any given time , one can determine whether the stopping time has occurred strictly based on the information available up to time . A stopping time cannot look into the future.
For a stochastic process , the first hitting time of a Borel set is defined as: When the process has right-continuous paths and is a closed set, is guaranteed to be a stopping time.
Optional Stopping Theorem
Does evaluating a martingale at a stopping time preserve its expected value? In general, it might not. However, Doob’s Optional Stopping Theorem establishes the conditions under which the expected value at the stopping time equals the initial expected value, i.e., .
Let be a discrete-time martingale and be a stopping time with respect to the filtration . Then holds if any of the following conditions is satisfied:
- The stopping time is bounded almost surely: for some deterministic integer .
- The stopping time has a finite expectation , and the increments are conditionally bounded: there exists such that a.s. on .
- There exists a constant such that almost surely for all .
This theorem highlights the impossibility of formulating a systemic winning strategy in a fair game under bounded resource constraints (the origin of the impossibility of the classical “Martingale betting strategy”).
Brownian Motion (Wiener Process)
The Wiener process (or standard Brownian motion) is the fundamental continuous-time analog of the random walk. It drives modern financial theory, statistical mechanics, and continuous-state probability.
A standard one-dimensional Wiener process is a stochastic process characterized by the following properties:
- almost surely.
- has independent increments: For any , the random variables are independent.
- has stationary normally distributed increments: For any , the increment follows a normal distribution:
- The paths are almost surely continuous.
Despite being continuous everywhere, the path of a Brownian motion is differentiable nowhere. Its quadratic variation over the interval is exactly . That is, . This strict non-zero quadratic variation is the very reason why ordinary calculus (Newton-Leibniz) fails for stochastic processes and necessitate a distinct calculus.
Interactive Lab
Read the code, make a small change, then run it and inspect the output. Runtime setup messages stay outside the terminal so the result remains focused on what the program prints.
Itô’s Lemma
Because Brownian motion has non-zero quadratic variation, the standard chain rule of differential calculus does not hold. Instead, we use Itô’s Calculus, anchored by Itô’s Lemma.
Let be an Itô drift-diffusion process satisfying the stochastic differential equation: where is a standard Wiener process, and are adapted processes. Let be a scalar function that is twice continuously differentiable in and once in (i.e., ).
By Itô’s Lemma, the process is also an Itô process whose differential is given by:
The profound emergence of the term reflects the quadratic variation of , often formalized by the heuristic multiplication rules:
In quantitative finance, the standard model for a stock price $S_t$ assumes the proportional return $dS_t / S_t$ undergoes constant drift and volatility, modeled by the stochastic differential equation: $dS_t = \mu S_t dt + \sigma S_t dW_t$. To find the distribution of $S_t$, we need to solve this. Applying standard ODE techniques fails because of the $dW_t$ term. We must use Itô's lemma to transform the equation, commonly via the natural logarithm function.
Apply Itô's Lemma to the function $f(t, S_t) = \ln(S_t)$ where $dS_t = \mu S_t dt + \sigma S_t dW_t$. What is the resulting stochastic differential equation for $d(\ln S_t)$?
Stochastic Differential Equations (SDEs)
A Stochastic Differential Equation relates the continuous-time dynamics of a stochastic process to a deterministic drift part and a stochastic diffusion part. The general form is: This equation is simply a symbolic shorthand for the integral equation: where the first integral is a standard Lebesgue/Riemann integral and the second is an Itô stochastic integral.
Existence and Uniqueness
Much like Picard–Lindelöf for deterministic ODEs, there are conditions for the strong existence and uniqueness of solutions to SDEs. Under Lipschitz continuity and linear growth bounding conditions:
- Lipschitz Condition:
- Linear Growth:
for some constants and all , there exists a unique strong solution to the SDE.
The analysis, simulation, and integration of SDEs form the bedrock of continuously evolving systems subject to noise across physics, mathematical biology, and finance.