SearcharxivSearch

arXiv · 1306.3923

Applying the Wiener-Hopf Monte Carlo simulation technique for Levy processes to path functionals such as first passage times, undershoots and overshoots

Abstract

In this note we apply the recently established Wiener-Hopf Monte Carlo (WHMC) simulation technique for Levy processes from Kuznetsov et al. [17] to path functionals, in particular first passage times, overshoots, undershoots and the last maximum before the passage time. Such functionals have many applications, for instance in finance (the pricing of exotic options in a Levy model) and insurance (ruin time, debt at ruin and related quantities for a Levy insurance risk process). The technique works for any Levy process whose running infimum and supremum evaluated at an independent exponential time allows sampling from. This includes classic examples such as stable processes, subclasses of spectrally one sided Levy processes and large new families such as meromorphic Levy processes. Finally we present some examples. A particular aspect that is illustrated is that the WHMC simulation technique performs much better at approximating first passage times than a `plain' Monte Carlo simulation technique based on sampling increments of the Levy process.

Explore related subjects

Keep this discovery

BibTeXRIS

Albert Ferreiro-Castilla, Kees van Schaik. 2014-03-02. Applying the Wiener-Hopf Monte Carlo simulation technique for Levy processes to path functionals such as first passage times, undershoots and overshoots. https://arxiv.org/abs/1306.3923

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