SearcharxivSearch

arXiv · 2311.02375

Williams' path decomposition for self-similar Markov processes in $\mathbb{R}^d$

Abstract

The classical result due tof Williams states that a Brownian motion with positive drift $\mu$ and issued from the origin is equal in law to a Brownian motion with unit negative drift, $-\mu$, run until it hits a negative threshold, whose depth below the origin is independently and exponentially distributed with parameter $2\mu$, after which it behaves like a Brownian motion conditioned never to go below the aforesaid threshold (i.e. a Bessel-3 process, or equivalently a Brownian motion conditioned to stay positive, relative to the threshold). In this article we consider the analogue of Williams' path decomposition for a general self-similar Markov process (ssMp) on $\mathbb{R}^d$. Roughly speaking, we will prove that law of a ssMp, say $X$, in $\mathbb{R}^d$ is equivalent in law to the concatenation of paths described as follows: suppose that we sample the point $x^*$ according to the law of the point of closest reach to the origin, sample; given $x^*$, we build $X^{\downarrow}$ having the law of $X$ conditioned to hit $x^*$ continuously without entering the ball of radius $|x^*|$; then, we construct $X^\uparrow$ to have the law of $X$ issued from $x^*$ conditioned never to enter the ball of radius $|x^*|$; glueing the path of $X^\uparrow$ end-to-end with $X^\downarrow$ via the point $x^*$ produces a process which is equal in law to our original ssMp $X$. In essence, Williams' path decomposition in the setting of a ssMp follows directly from an analogous decomposition for Markov additive processes (MAPs). The latter class are intimately related to the former via a space-time transform known as the Lamperti--Kiu transform. As a key feature of our proof of Williams' path decomposition, will prove the analogue of Silverstein's duality identity for the excursion occupation measure for general Markov additive processes (MAPs).

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas Kyprianou, Mehar Motala, Víctor Rivero. 2023-11-04. Williams' path decomposition for self-similar Markov processes in $\mathbb{R}^d$. https://arxiv.org/abs/2311.02375

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