SearcharxivSearch

arXiv · 1112.4208

On the density of the supremum of a stable process

Abstract

We study the density of the supremum of a strictly stable Lévy process. As was proved recently in F. Hubalek and A. Kuznetsov "A convergent series representation for the density of the supremum of a stable process" (Elect. Comm. in Probab., 16, 84-95, 2011), for almost all irrational values of the stability parameter $α$ this density can be represented by an absolutely convergent series. We show that this result is not valid for all irrational values of $α$: we construct a dense uncountable set of irrational numbers $α$ for which the series does not converge absolutely. Our second goal is to investigate in more detail the important case when $α$ is rational. We derive an explicit formula for the Mellin transform of the supremum, which is given in terms of Gamma function and dilogarithm. In order to illustrate the usefulness of these results we perform several numerical experiments and discuss their implications. Finally, we state some interesting connections that this problem has to other areas of Mathematics and Mathematical Physics, such as q-series, Diophantine approximations and quantum dilogarithms, and we also suggest several open problems.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexey Kuznetsov. 2011-12-19. On the density of the supremum of a stable process. https://arxiv.org/abs/1112.4208

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