Search arXivSearch

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 $μ$ and issued from the origin is equal in law to a Brownian motion with unit negative drift, $-μ$, run until it hits a negative threshold, whose depth below the origin is independently and exponentially distributed with parameter $2μ$, 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

Explore connections, maps & timelines

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

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR