SearcharxivSearch

arXiv · 1511.06356

Deep factorisation of the stable process II; potentials and applications

Abstract

Here we propose a different perspective of the deep factorisation in Kyprianou (2015) based on determining potentials. Indeed, we factorise the inverse of the MAP-exponent associated to a stable process via the Lamperti-Kiu transform. Here our factorisation is completely independent from the derivation in Kyprianou (2015) , moreover there is no clear way to invert the factors in Kyprianou (2015) to derive our results. Our method gives direct access to the potential densities of the ascending and descending ladder MAP of the Lamperti-stable MAP in closed form. In the spirit of the interplay between the classical Wiener-Hopf factorisation and fluctuation theory of the underlying Levy process, our analysis will produce a collection of of new results for stable processes. We give an identity for the point of closest reach to the origin for a stable process with index $\alpha\in (0,1)$ as well as and identity for the point of furthest reach before absorption at the origin for a stable process with index $\alpha\in (1,2)$. Moreover, we show how the deep factorisation allows us to compute explicitly the stationary distribution of stable processes multiplicatively reflected in such a way that it remains in the strip [-1,1].

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas E. Kyprianou, Victor Rivero, Bati Sengul. 2015-11-19. Deep factorisation of the stable process II; potentials and applications. https://arxiv.org/abs/1511.06356

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