Search arXivSearch

arXiv · 1101.1369

Multilevel Monte Carlo algorithms for Lévy-driven SDEs with Gaussian correction

Abstract

We introduce and analyze multilevel Monte Carlo algorithms for the computation of $\mathbb {E}f(Y)$, where $Y=(Y_t)_{t\in[0,1]}$ is the solution of a multidimensional Lévy-driven stochastic differential equation and $f$ is a real-valued function on the path space. The algorithm relies on approximations obtained by simulating large jumps of the Lévy process individually and applying a Gaussian approximation for the small jump part. Upper bounds are provided for the worst case error over the class of all measurable real functions $f$ that are Lipschitz continuous with respect to the supremum norm. These upper bounds are easily tractable once one knows the behavior of the Lévy measure around zero. In particular, one can derive upper bounds from the Blumenthal--Getoor index of the Lévy process. In the case where the Blumenthal--Getoor index is larger than one, this approach is superior to algorithms that do not apply a Gaussian approximation. If the Lévy process does not incorporate a Wiener process or if the Blumenthal--Getoor index $β$ is larger than $\frac{4}{3}$, then the upper bound is of order $τ^{-({4-β})/({6β})}$ when the runtime $τ$ tends to infinity. Whereas in the case, where $β$ is in $[1,\frac{4}{3}]$ and the Lévy process has a Gaussian component, we obtain bounds of order $τ^{-β/(6β-4)}$. In particular, the error is at most of order $τ^{-1/6}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steffen Dereich. 2011-01-07. Multilevel Monte Carlo algorithms for Lévy-driven SDEs with Gaussian correction. https://doi.org/10.1214/10-aap695

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

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR