SearcharxivSearch

arXiv · 1207.4736

Predicting the time at which a Lévy process attains its ultimate supremum

Abstract

We consider the problem of finding a stopping time that minimises the $L^1$-distance to $θ$, the time at which a Lévy process attains its ultimate supremum. This problem was studied in [12] for a Brownian motion with drift and a finite time horizon. We consider a general Lévy process and an infinite time horizon (only compound Poisson processes are excluded, furthermore due to the infinite horizon the problem is only interesting when the Lévy process drifts to $-\infty$). Existing results allow us to rewrite the problem as a classic optimal stopping problem, i.e. with an adapted payoff process. We show the following. If $θ$ has infinite mean there exists no stopping time with a finite $L^1$-distance to $θ$, whereas if $θ$ has finite mean it is either optimal to stop immediately or to stop when the process reflected in its supremum exceeds a positive level, depending on whether the median of the law of the ultimate supremum equals zero or is positive. Furthermore, pasting properties are derived. Finally, the result is made more explicit in terms of scale functions in the case when the Lévy process has no positive jumps.

Explore related subjects

Keep this discovery

BibTeXRIS

Erik Baurdoux, Kees van Schaik. 2014-01-07. Predicting the time at which a Lévy process attains its ultimate supremum. https://arxiv.org/abs/1207.4736

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