Doob Conditioning in Markov Processes

• Doob conditioning is a method that transforms Markov processes by using harmonic or excessive functions to impose specific constraints.
• It enables efficient simulation of rare events and large deviations by modifying trajectory probabilities, with applications in optimal control.
• The framework finds diverse applications from bridges in Brownian motion to generative diffusion models and conditioned branching processes.

Doob conditioning refers to a broad set of constructions for Markov processes, stochastic differential equations, and statistical decision theory in which a process is transformed or "conditioned" to satisfy specified constraints—typically by modifying its transition dynamics via a space-time harmonic (or excessive) function. Central to these methodologies is the Doob $h$-transform, which yields a new process whose law matches that of the original process under a conditioning event, such as achieving a rare terminal state, remaining in a cone, non-extinction, or attaining a particular occupation measure. The framework is closely related to the general theory of conditional expectations (Doob–Dynkin lemma), large deviations, optimal control, the analysis of rare events, and the structure of Markov process boundaries.

1. The Doob $h$-Transform and Conditioning Principle

Let $X_t$ be a Markov process on state space $E$ with generator $L$. Suppose $h:E\to(0,\infty)$ is harmonic for $L$ ($L h=0$ on $D\subset E$) or, more generally, excessive. The Doob $h$-transform constructs a new Markov process with semigroup

$h$0

and generator

$h$1

where $h$2 is the exit time from $h$3. For continuous-time diffusions,

$h$4

if one conditions on $h$5, the appropriate space-time harmonic function $h$6 solves the backward Kolmogorov equation

$h$7

with $h$8. The $h$9-transformed process has drift

$X_t$0

This construction ensures the new process is distributed as the original process conditioned (e.g., on $X_t$1) (Mamede et al., 23 May 2026, Kyprianou et al., 2021).

2. Large Deviations, Optimal Control, and Pathwise Representations

In the small-noise regime ($X_t$2), Doob conditioning facilitates the efficient simulation and analysis of rare events by reweighting trajectories so that the prescribed rare event becomes typical. For an additive observable $X_t$3, the moment generating function under Doob conditioning exhibits a large deviation scaling: $X_t$4 where the rate function $X_t$5 arises as the value of a variational (optimal control) problem: $X_t$6 Here $X_t$7 is a Lagrangian encoding the deviation from typical dynamics and the observable tilt, and $X_t$8 enforces endpoint constraints (Mamede et al., 23 May 2026).

The Doob transform can also be interpreted as a post-selection procedure: the conditioned law is realized by reweighting the original path measure with the time-dependent harmonic function $X_t$9, reflecting the likelihood of achieving the constraint.

3. Examples: Bridges, Lévy Processes, and Conditioned Trees

• Brownian Bridge: Conditioning Brownian motion to hit $E$0 at time $E$1 yields the classical Brownian bridge. The Doob $E$2-transform drift is $E$3 (Mamede et al., 23 May 2026).
• Ornstein-Uhlenbeck Bridge: Conditioning on an endpoint yields a nontrivial, time-dependent drift deduced from the explicit $E$4 (a Gaussian kernel) (Mamede et al., 23 May 2026).
• Stable Lévy Processes: For the one-dimensional symmetric $E$5-stable process, the $E$6-transform with $E$7 on $E$8 yields a process equivalent in law to the radial part of a three-dimensional isotropic $E$9-stable process—the Doob–McKean identity generalizes to jump processes (Kyprianou et al., 2021).
• Rémy's Tree Growth Chain: The Doob–Martin compactification for Rémy’s Markov chain on binary trees explicitly identifies all ways the process can “go to infinity.” The Doob $L$0-transform provides the canonical way to condition on convergence to a boundary point, realized as an extremal (minimal) harmonic function in terms of sampled subtrees and limiting $L$1-tree structures (Evans et al., 2014).

4. Doob Conditioning in Self-Interacting and Constrained Processes

Markov processes with path-constrained observables (e.g., occupation time, empirical measures) can be optimally sampled by constructing a self-interacting dynamics, where the transition probabilities at each step depend on the constrained empirical history. The Doob conditioning framework systematically constructs such processes: $L$2 with $L$3 solving the appropriate backward equation. This approach realizes optimal simulation of rare events (e.g., bridges, excursions, forced excursions) and aligns with dynamic programming in optimal control (Coghi et al., 3 Mar 2025).

5. Conditioning Branching and Population Processes

Conditioning continuous-state branching processes, such as the logistic CB process, on non-extinction or infinite progeny is realized by an explicit Doob $L$4-transform. The excessive function $L$5 is constructed via an integral involving the process' scale functions, and the resulting process incorporates an additional, density-dependent immigration term. Under the transformed law, the process exhibits either explosion (finite lifetime) or enters from zero, with generator

$L$6

where $L$7 is the original generator. Convergence criteria, duality relations, and explicit martingale characterizations are established (Foucart et al., 2024).

6. Applications in Conditional Generative Modeling and Machine Learning

Doob’s $L$8-transform is directly exploited for conditioning generative models, especially diffusion models. In adaptation problems, the $L$9-transform enables measure transportation to a target distribution by dynamically modifying the drift with $h:E\to(0,\infty)$0, where $h:E\to(0,\infty)$1 matches the desired event or high-reward property. This approach supports efficient, training-free, simulation-based adaptation, including for non-differentiable objectives, with finite-sample guarantees and established convergence rates. Practical approximations circumvent explicit calculation of $h:E\to(0,\infty)$2, using Monte Carlo evaluation or one-step surrogates. Empirical results validate these theoretical properties in offline RL and text-to-image generation (Zhu et al., 18 Feb 2026).

7. The Doob–Dynkin Lemma and Conditional Expectation

In a foundational sense, Doob conditioning generalizes to the factorization properties given by the Doob–Dynkin lemma: any random variable measurable with respect to another function can be written as a measurable function thereof, underpinning $h:E\to(0,\infty)$3 as a concrete function of $h:E\to(0,\infty)$4. This principle is crucial in statistical learning, Bayesian estimation, and conditional Monte Carlo, providing the technical justification for representing conditional expectations as explicit functions and supporting optimal prediction and inference (Taraldsen, 2018).

---

References

• "Rare events of small-noise Doob conditioned processes" (Mamede et al., 23 May 2026)
• "The Doob-McKean identity for stable Lévy processes" (Kyprianou et al., 2021)
• "Doob--Martin boundary of Rémy's tree growth chain" (Evans et al., 2014)
• "Self-interacting processes via Doob conditioning" (Coghi et al., 3 Mar 2025)
• "Conditioning the logistic continuous-state branching process on non-extinction via its total progeny" (Foucart et al., 2024)
• "Training-Free Adaptation of Diffusion Models via Doob's $h:E\to(0,\infty)$5-Transform" (Zhu et al., 18 Feb 2026)
• "Optimal Learning from the Doob-Dynkin lemma" (Taraldsen, 2018)