Vol. 6, No. 1, 2011

Download this article
Download this article For screen
For printing
Recent Issues
Volume 18, Issue 1
Volume 17, Issue 1
Volume 16, Issue 2
Volume 16, Issue 1
Volume 15, Issue 2
Volume 15, Issue 1
Volume 14, Issue 2
Volume 14, Issue 1
Volume 13, Issue 2
Volume 13, Issue 1
Volume 12, Issue 1
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 1
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 1
Volume 5, Issue 2
Volume 5, Issue 1
Volume 4, Issue 1
Volume 3, Issue 1
Volume 2, Issue 1
Volume 1, Issue 1
The Journal
About the Journal
Editorial Board
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
ISSN: 2157-5452 (e-only)
ISSN: 1559-3940 (print)
Author Index
To Appear
Other MSP Journals
Conditional path sampling for stochastic differential equations through drift relaxation

Panos Stinis

Vol. 6 (2011), No. 1, 63–78

We present an algorithm for the efficient sampling of conditional paths of stochastic differential equations (SDEs). While unconditional path sampling of SDEs is straightforward, albeit expensive for high dimensional systems of SDEs, conditional path sampling can be difficult even for low dimensional systems. This is because we need to produce sample paths of the SDE that respect both the dynamics of the SDE and the initial and endpoint conditions. The dynamics of a SDE are governed by the deterministic term (drift) and the stochastic term (noise). Instead of producing conditional paths directly from the original SDE, one can consider a sequence of SDEs with modified drifts. The modified drifts should be chosen so that it is easier to produce sample paths that satisfy the initial and endpoint conditions. Also, the sequence of modified drifts should converge to the drift of the original SDE. We construct a simple Markov chain Monte Carlo algorithm that samples, in sequence, conditional paths from the modified SDEs, by taking the last sampled path at each level of the sequence as an initial condition for the sampling at the next level in the sequence. The algorithm can be thought of as a stochastic analog of deterministic homotopy methods for solving nonlinear algebraic equations or as a SDE generalization of simulated annealing. The algorithm is particularly suited for filtering/smoothing applications. We show how it can be used to improve the performance of particle filters. Numerical results for filtering of a stochastic differential equation are included.

conditional path sampling, stochastic differential equations, particle filters, homotopy methods, Monte Carlo, simulated annealing
Mathematical Subject Classification 2000
Primary: 60G35, 62M20, 65C05, 65C30, 93E10
Received: 30 August 2010
Revised: 23 February 2011
Accepted: 21 March 2011
Published: 29 April 2011
Panos Stinis
School of Mathematics
University of Minnesota
206 Church St SE
Minneapolis, MN 55455
United States