SearcharxivSearch

arXiv · 1103.1460

On the drawdown of completely asymmetric Levy processes

Abstract

The {\em drawdown} process $Y$ of a completely asymmetric Lévy process $X$ is equal to $X$ reflected at its running supremum $\bar{X}$: $Y = \bar{X} - X$. In this paper we explicitly express in terms of the scale function and the Lévy measure of $X$ the law of the sextuple of the first-passage time of $Y$ over the level $a>0$, the time $\bar{G}_{τ_a}$ of the last supremum of $X$ prior to $τ_a$, the infimum $\unl X_{τ_a}$ and supremum $\ovl X_{τ_a}$ of $X$ at $τ_a$ and the undershoot $a - Y_{τ_a-}$ and overshoot $Y_{τ_a}-a$ of $Y$ at $τ_a$. As application we obtain explicit expressions for the laws of a number of functionals of drawdowns and rallies in a completely asymmetric exponential Lévy model.

Explore related subjects

Keep this discovery

BibTeXRIS

Aleksandar Mijatovic, Martijn R. Pistorius. 2012-09-11. On the drawdown of completely asymmetric Levy processes. https://arxiv.org/abs/1103.1460

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