SearcharxivSearch

arXiv · 2108.04480

Predicting the Last Zero before an exponential time of a Spectrally Negative L\'evy Process

Abstract

Given a spectrally negative L\'evy process, we predict, in a $L_1$ sense, the last passage time of the process below zero before an independent exponential time. This optimal prediction problem generalises Baurdoux and Pedraza (2020) where the infinite horizon problem is solved. Using a similar argument as that in Urusov (2005), we show that this optimal prediction problem is equivalent to solving an optimal prediction problem in a finite horizon setting. Surprisingly (unlike the infinite horizon problem) an optimal stopping time is based on a curve that is killed at the moment the mean of the exponential time is reached. That is, an optimal stopping time is the first time the process crosses above a non-negative, continuous and non-increasing curve depending on time. This curve and the value function are characterised as a solution of a system of non-linear integral equations which can be understood as a generalisation of the free boundary equations (see e.g. Peskir and Shiryaev (2006) Chapter IV.14.1) in the presence of jumps. As an example, we calculate numerically such curve in the Brownian motion case and a compound Poisson process with exponential sized jumps perturbed by a Brownian motion.

Explore related subjects

Keep this discovery

BibTeXRIS

Erik J. Baurdoux, José M. Pedraza. 2021-08-10. Predicting the Last Zero before an exponential time of a Spectrally Negative L\'evy Process. https://arxiv.org/abs/2108.04480

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