Search arXivSearch

arXiv · 0912.4743

A Wiener--Hopf Monte Carlo simulation technique for Lévy processes

Abstract

We develop a completely new and straightforward method for simulating the joint law of the position and running maximum at a fixed time of a general Lévy process with a view to application in insurance and financial mathematics. Although different, our method takes lessons from Carr's so-called "Canadization" technique as well as Doney's method of stochastic bounds for Lévy processes; see Carr [Rev. Fin. Studies 11 (1998) 597--626] and Doney [Ann. Probab. 32 (2004) 1545-1552]. We rely fundamentally on the Wiener-Hopf decomposition for Lévy processes as well as taking advantage of recent developments in factorization techniques of the latter theory due to Vigon [Simplifiez vos Lévy en titillant la factorization de Wiener-Hopf (2002) Laboratoire de Mathématiques de L'INSA de Rouen] and Kuznetsov [Ann. Appl. Probab. 20 (2010) 1801--1830]. We illustrate our Wiener--Hopf Monte Carlo method on a number of different processes, including a new family of Lévy processes called hypergeometric Lévy processes. Moreover, we illustrate the robustness of working with a Wiener--Hopf decomposition with two extensions. The first extension shows that if one can successfully simulate for a given Lévy processes then one can successfully simulate for any independent sum of the latter process and a compound Poisson process. The second extension illustrates how one may produce a straightforward approximation for simulating the two-sided exit problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. Kuznetsov, A. E. Kyprianou, J. C. Pardo, K. van Schaik. 2012-02-17. A Wiener--Hopf Monte Carlo simulation technique for Lévy processes. https://doi.org/10.1214/10-aap746

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