Search Results
Path-wise approximation of the Cox-Ingersoll-Ross process
2013, Milstein, Grigori N., Schoenmakers, John G.M.
The Doss-Sussmann (DS) approach is used for simulating the Cox-Ingersoll-Ross (CIR) process. The DS formalism allows for expressing trajectories of the CIR process by solutions of some ordinary differential equation (ODE) that depend on realizations of the Wiener process involved. Via simulating the first-passage times of the increments of the Wiener process to the boundary of an interval and solving an ODE, we approximately construct the trajectories of the CIR process. From a conceptual point of view the proposed method may be considered as an exact simulation approach.
Forward and reverse representations for Markov chains
2006, Milstein, Grigori N., Schoenmakers, John G.M., Spokoiny, Vladimir
In this paper we carry over the concept of reverse probabilistic representations developed in Milstein, Schoenmakers, Spokoiny (2004) for diffusion processes, to discrete time Markov chains. We outline the construction of reverse chains in several situations and apply this to processes which are connected with jump-diffusion models and finite state Markov chains. By combining forward and reverse representations we then construct transition density estimators for chains which have root-N accuracy in any dimension and consider some applications.
Uniform approximation of the CIR process via exact simulation at random times
2015, Milstein, Grigori N., Schoenmakers, John G.M.
In this paper we uniformly approximate the trajectories of the Cox-Ingersoll-Ross (CIR) process. At a sequence of random times the approximate trajectories will be even exact. In between, the approximation will be uniformly close to the exact trajectory. From a conceptual point of view the proposed method gives a better quality of approximation in a path-wise sense than standard, or even exact simulation of the CIR dynamics at some deterministic time grid.
Sensitivities for Bermudan options by regression methods
2007, Belomestny, Denis, Milstein, Grigori N., Schoenmakers, John
In this article we propose several pathwise and finite difference based methods for calculating sensitivities of Bermudan options using regression methods and Monte Carlo simulation. These methods rely on conditional probabilistic representations which allows, in combination with a regression approach, an efficient simultaneous computation of sensitivities at all initial positions. Assuming that the price of a Bermudan option can be evaluated sufficiently accurate, we develop a method for constructing deltas based on least squares. We finally propose a testing procedure for assessing the performance of the developed methods.