We describe a new, surprisingly simple algorithm, that simulates exact sample paths of a class of stochastic differential equations. It involves rejection sampling and, when applicable, returns the location of the path at a random collection of time instances. The path can then be completed without further reference to the dynamics of the target process.
No takes yet. Share an insight, caveat, or question.
Beskos et al. (2005) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: