SearcharxivSearch

arXiv · 1604.06028

Efficient computation of first passage times in Kou's jump-diffusion model

Abstract

S. G. Kou and H. Wang [First Passage times of a Jump Diffusion Process \textit{Ann. Appl. Probab.} {\bf 35} (2003) 504--531] give expressions of both the (real) Laplace transform of the distribution of first passage time and the (real) Laplace transform of the joint distribution of the first passage time and the running maxima of a jump-diffusion model called Kou model. %However, to invert the last Laplace transform it is needed Kuo and Wang invert the first Laplace transform by using Gaver-Stehfest algorithm, and the inversion of second one involves a large computing time with an algebra computer system. In the present paper, we give a much simpler expression of the Laplace transform of the joint distribution, and we also show, using Complex Analysis techniques, that both Laplace transform can be extended to the complex plane. Hence, we can use variants of the Fourier-series methods to invert that Laplace transfoms, which are very efficent. The improvement in the computing times and accuracy is remarkable.

Explore related subjects

Keep this discovery

BibTeXRIS

Abdel Belkaid, Frederic Utzet. 2016-04-20. Efficient computation of first passage times in Kou's jump-diffusion model. https://arxiv.org/abs/1604.06028

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR