SearcharxivSearch

arXiv · 1502.07399

Deep factorisation of the stable process

Abstract

The Lamperti--Kiu transformation for real-valued self-similar Markov processes (rssMp) states that, associated to each rssMp via a space-time transformation, there is a Markov additive process (MAP). In the case that the rssMp is taken to be an $\alpha$-stable process with $\alpha\in(0,2)$, Chaumont et al. (2013) and Kuznetsov et al. (2014) have computed explicitly the characteristics of the matrix exponent of the semi-group of the embedded MAP, which we henceforth refer to as the {\it Lamperti-stable MAP}. Specifically, the matrix exponent of the Lamperti-stable MAP's transition semi-group can be written in a compact form using only gamma functions. Just as with L\'evy processes, there exists a factorisation of the (matrix) exponents of MAPs, with each of the two factors uniquely characterising the ascending and descending ladder processes, which themselves are again MAPs. To the author's knowledge, not a single example of such a factorisation currently exists in the literature. In this article we provide a completely explicit Wiener--Hopf factorisation for the Lamperti-stable MAP. As a consequence of our methodology, we also get additional new results concerning space-time invariance properties of stable processes. Accordingly we develop some new fluctuation identities therewith.

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas E. Kyprianou. 2015-02-25. Deep factorisation of the stable process. https://arxiv.org/abs/1502.07399

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