Creeping of L\'evy processes through curves
Lo\"ic Chaumont, Thomas Pellas

TL;DR
This paper investigates the probability that Lévy processes creep through curves, providing explicit formulas for bivariate subordinators and applications to real Lévy processes, including conditioned processes and Ornstein-Uhlenbeck models.
Contribution
It offers new explicit expressions for creeping probabilities of Lévy processes through curves, extending previous results to more general functions and process conditions.
Findings
Derived formulas for creeping probabilities of bivariate subordinators.
Applied results to real Lévy processes reaching their past supremum.
Provided examples including stable Ornstein-Uhlenbeck processes.
Abstract
A L\'evy process is said to creep through a curve if, at its first passage time across this curve, the process reaches it with positive probability. We first study this property for bivariate subordinators. Given the graph of any continuous, non increasing function such that , we give an expression of the probability that a bivariate subordinator issued from 0 creeps through this graph in terms of its renewal function and the drifts of the components and . We apply this result to the creeping probability of any real L\'evy process through the graph of any continuous, non increasing function at a time where the process also reaches its past supremum. This probability involves the density of the renewal function of the bivariate upward ladder process as well as its drift coefficients. We also investigate the case of L\'evy processes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbability and Risk Models · Stochastic processes and statistical mechanics · Advanced Queuing Theory Analysis
