On some transformations between positive self--similar Markov processes
Abstract
A path decomposition at the infimum for positive self-similar Markov processes (pssMp) is obtained. Next, several aspects of the conditioning to hit 0 of a pssMp are studied. Associated to a given a pssMp X, that never hits 0, we construct a pssMp X that hits 0 in a finite time. The latter can be viewed as X conditioned to hit 0 in a finite time and we prove that this conditioning is determined by the pre-minimum part of X. Finally, we provide a method for conditioning a pssMp that hits 0 by a jump to do it continuously.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.