SearcharxivSearch

arXiv · 2609.03634

Joint Laws of Maximum Drawdown and Maximum Drawup for Spectrally Negative L\'evy Processes

Abstract

Let X be a spectrally negative L\'evy process observed up to an inde- pendent exponential time T with parameter {\gamma} > 0. We study the joint law of the maximum drawdown and the maximum drawup of X on [0, T ]. The path is decomposed according to the two possible orderings of its in- fimum and supremum. Conditional on the values of these extrema and on their ordering, the resulting pre-, intermediate, and post- components are independent. We identify their laws as Doob h-transforms of killed spec- trally negative L\'evy processes and express the corresponding distribution functions explicitly in terms of the {\gamma}-scale functions W ({\gamma}) and Z({\gamma}) and their derivatives. Combining the conditional laws with the joint densities of the extrema yields integral representations of the joint distribution and moments.

Explore related subjects

Keep this discovery

BibTeXRIS

Ceren Vardar Acar, Emre Akdogan. 2026-09-03. Joint Laws of Maximum Drawdown and Maximum Drawup for Spectrally Negative L\'evy Processes. https://arxiv.org/abs/2609.03634

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