Open Access
2017 Inversion, duality and Doob $h$-transforms for self-similar Markov processes
Larbi Alili, Loïc Chaumont, Piotr Graczyk, Tomasz Żak
Electron. J. Probab. 22: 1-18 (2017). DOI: 10.1214/17-EJP33

Abstract

We show that any $\mathbb{R} ^d\setminus \{0\}$-valued self-similar Markov process $X$, with index $\alpha >0$ can be represented as a path transformation of some Markov additive process (MAP) $(\theta ,\xi )$ in $S_{d-1}\times \mathbb{R} $. This result extends the well known Lamperti transformation. Let us denote by $\widehat{X} $ the self-similar Markov process which is obtained from the MAP $(\theta ,-\xi )$ through this extended Lamperti transformation. Then we prove that $\widehat{X} $ is in weak duality with $X$, with respect to the measure $\pi (x/\|x\|)\|x\|^{\alpha -d}dx$, if and only if $(\theta ,\xi )$ is reversible with respect to the measure $\newcommand{\ed } {\stackrel{(d)} {=}} \pi (ds)dx$, where $\pi (ds)$ is some $\sigma $-finite measure on $S_{d-1}$ and $dx$ is the Lebesgue measure on $\mathbb{R} $. Moreover, the dual process $\widehat{X} $ has the same law as the inversion $(X_{\gamma _t}/\|X_{\gamma _t}\|^2,t\ge 0)$ of $X$, where $\gamma _t$ is the inverse of $t\mapsto \int _0^t\|X\|_s^{-2\alpha }\,ds$. These results allow us to obtain excessive functions for some classes of self-similar Markov processes such as stable Lévy processes.

Citation

Download Citation

Larbi Alili. Loïc Chaumont. Piotr Graczyk. Tomasz Żak. "Inversion, duality and Doob $h$-transforms for self-similar Markov processes." Electron. J. Probab. 22 1 - 18, 2017. https://doi.org/10.1214/17-EJP33

Information

Received: 22 March 2016; Accepted: 30 January 2017; Published: 2017
First available in Project Euclid: 18 February 2017

zbMATH: 1357.60079
MathSciNet: MR3622890
Digital Object Identifier: 10.1214/17-EJP33

Subjects:
Primary: 31C05 , 60J45
Secondary: 60J65 , 60J75

Keywords: Doob $h$-transform , Duality , inversion , Markov additive processes , Self-similar Markov processes , Time change

Vol.22 • 2017
Back to Top