SearcharxivSearch

arXiv · 1408.0898

Importance Sampling and Statistical Romberg Method for L\'evy Processes

Abstract

An important family of stochastic processes arising in many areas of applied probability is the class of L\'evy processes. Generally, such processes are not simulatable especially for those with infinite activity. In practice, it is common to approximate them by truncating the jumps at some cut-off size $\varepsilon$ ($\varepsilon\searrow 0$). This procedure leads us to consider a simulatable compound Poisson process. This paper first introduces, for this setting, the statistical Romberg method to improve the complexity of the classical Monte Carlo one. Roughly speaking, we use many sample paths with a coarse cut-off $\varepsilon^{\beta},$ $\beta\in(0,1)$, and few additional sample paths with a fine cut-off $\varepsilon$. Central limit theorems of Lindeberg-Feller type for both Monte Carlo and statistical Romberg method for the inferred errors depending on the parameter $\varepsilon$ are proved. This leads to an accurate description of the optimal choice of parameters with explicit limit variances. Afterwards, the authors propose a stochastic approximation method of finding the optimal measure change by Esscher transform for L\'evy processes with Monte Carlo and statistical Romberg importance sampling variance reduction. Furthermore, we develop new adaptive Monte Carlo and statistical Romberg algorithms and prove the associated central limit theorems. Finally, numerical simulations are processed to illustrate the efficiency of the adaptive statistical Romberg method that reduces at the same time the variance and the computational effort associated to the effective computation of option prices when the underlying asset process follows an exponential pure jump CGMY model.

Explore related subjects

Keep this discovery

BibTeXRIS

M. Ben Alaya, K. Hajji, A. Kebaier. 2014-08-05. Importance Sampling and Statistical Romberg Method for L\'evy Processes. https://arxiv.org/abs/1408.0898

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