Bridges of Lévy processes conditioned to stay positive
arXiv:1101.4184 · doi:10.3150/12-BEJ481
Abstract
We consider Kallenberg's hypothesis on the characteristic function of a Lévy process and show that it allows the construction of weakly continuous bridges of the Lévy process conditioned to stay positive. We therefore provide a notion of normalized excursions Lévy processes above their cumulative minimum. Our main contribution is the construction of a continuous version of the transition density of the Lévy process conditioned to stay positive by using the weakly continuous bridges of the Lévy process itself. For this, we rely on a method due to Hunt which had only been shown to provide upper semi-continuous versions. Using the bridges of the conditioned Lévy process, the Durrett-Iglehart theorem stating that the Brownian bridge from to conditioned to remain above converges weakly to the Brownian excursion as , is extended to Lévy processes. We also extend the Denisov decomposition of Brownian motion to Lévy processes and their bridges, as well as Vervaat's classical result stating the equivalence in law of the Vervaat transform of a Brownian bridge and the normalized Brownian excursion.
Published in at http://dx.doi.org/10.3150/12-BEJ481 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm)
References in corpus (2)
Cited by in corpus (12)
- The convex minorant of a Lévy process
- Convex minorants of random walks and Lévy processes
- The Vervaat transform of Brownian bridges and Brownian motion
- Dini derivatives for Exchangeable Increment processes and applications
- -strong simulation of the convex minorants of stable processes and meanders
- Scalar Conservation Laws with white noise initial data
- Shifting processes with cyclically exchangeable increments at random
- Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
- The argmin process of random walks, Brownian motion and Lévy processes
- Random Lévy Looptrees and Lévy Maps
- The first passage time of a stable process conditioned to not overshoot
- The argmin process of random walks and Lévy processes