SearcharxivSearch

arXiv · 2003.06869

$L_p$ optimal prediction of the last zero of a spectrally negative L\'evy process

Abstract

Given a spectrally negative L\'evy process $X$ drifting to infinity, (inspired on the early ideas of Shiryaev (2002)) we are interested in finding a stopping time that minimises the $L^p$ distance ($p>1$) with $g$, the last time $X$ is negative. The solution is substantially more difficult compared to the case $p=1$, for which it was shown in Baurdoux and Pedraza (2020b) that it is optimal to stop as soon as $X$ exceeds a constant barrier. In the case of $p>1$ treated here, we prove that solving this optimal prediction problem is equivalent to solving an optimal stopping problem in terms of a two-dimensional strong Markov process that incorporates the length of the current excursion away from $0$. We show that an optimal stopping time is now given by the first time that $X$ exceeds a non-increasing and non-negative curve depending on the length of the current excursion away from $0$. We further characterise the optimal boundary and the value function as the unique solution of a non-linear system of integral equations within a subclass of functions. As examples, the case of a Brownian motion with drift and a Brownian motion with drift perturbed by a Poisson process with exponential jumps are considered.

Explore related subjects

Keep this discovery

BibTeXRIS

Erik J. Baurdoux, J. M. Pedraza. 2020-03-15. $L_p$ optimal prediction of the last zero of a spectrally negative L\'evy process. https://arxiv.org/abs/2003.06869

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