SearcharxivSearch

arXiv · 1706.09924

Deep factorisation of the stable process III: Radial excursion theory and the point of closest reach

Abstract

In this paper, we continue our understanding of the stable process from the perspective of the theory of self-similar Markov processes in the spirit of the recent papers of Kyprianou (2016) and Kyprianou et al. (2017). In particular, we turn our attention to the case of $d$-dimensional isotropic stable process, for $d\geq 2$. Using a completely new approach we consider the distribution of the point of closest reach. This leads us to a number of other substantial new results for this class of stable processes. We engage with a new radial excursion theory, never before used, from which we develop the classical Blumenthal-Getoor-Ray identities for first entry/exit into a ball, cf. Blumenthal et al. (1961), to the setting of $n$-tuple laws. We identify explicitly the stationary distribution of the stable process when reflected in its running radial supremum. Moreover, we provide a representation of the Wiener-Hopf factorisation of the MAP that underlies the stable process through the Lamperti-Kiu transform.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Kyprianou, Victor Rivero, Weerapat Satitkanitkul. 2018-03-21. Deep factorisation of the stable process III: Radial excursion theory and the point of closest reach. https://arxiv.org/abs/1706.09924

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