Simulation of square-root processes made simple: applications to the Heston model
We introduce a simple, efficient and accurate nonnegative preserving numerical scheme for simulating the square-root process. The novel idea is to simulate the integrated square-root process first instead of the square-root process itself. Numerical experiments on realistic parameter sets, applied for the integrated process and the Heston model, display high precision with a very low number of time steps. As a bonus, our scheme yields the exact limiting Inverse Gaussian distributions of the integrated square-root process with only one single time-step in two scenarios: (i) for high mean-reversion and volatility-of-volatility regimes, regardless of maturity; and (ii) for long maturities, independent of the other parameters.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Square-root regret bounds for continuous-time episodic Markov decision processes
We study reinforcement learning for continuous-time Markov decision processes (MDPs) in the finite-horizon episodic setting. In contrast to discrete-time MDPs, the inter-transition times of a continuous-time MDP are expo…
reinforcement-learningReinforcement Learning (RL)Simulating integrated Volterra square-root processes and Volterra Heston models via Inverse Gaussian
We introduce a novel simulation scheme, iVi (integrated Volterra implicit), for integrated Volterra square-root processes and Volterra Heston models based on the Inverse Gaussian distribution. The scheme is designed to h…
First-Extinction Law for Resampling Processes
Extinction times in resampling processes are fundamental yet often intractable, as previous formulas scale as $2^M$ with the number of states $M$ present in the initial probability distribution. We solve this by treating…
Towards Gaussian processes modelling to study the late effects of radiotherapy in children and young adults with brain tumours
Survivors of childhood cancer need lifelong monitoring for side effects from radiotherapy. However, longitudinal data from routine monitoring is often infrequently and irregularly sampled, and subject to inaccuracies. Du…
Gaussian ProcessesEfficient Evolutionary Models with Digraphons
We present two main contributions which help us in leveraging the theory of graphons for modeling evolutionary processes. We show a generative model for digraphons using a finite basis of subgraphs, which is representati…