On fluctuation-theoretic decompositions via Lindley-type recursions
Onno Boxma, Offer Kella, Michel Mandjes

TL;DR
This paper presents a novel fluctuation-theoretic decomposition for the joint distribution of the maximum of a Lévy process and its last occurrence time, using Lindley-type recursions and Poisson observations.
Contribution
It introduces a new distributional equality decomposing the maximum and last occurrence time into independent components, extending Lindley recursion insights.
Findings
The decomposition holds for Lévy processes over exponential times.
Elementary proof provides deeper understanding of the decomposition.
Generalizations of Lindley recursion are derived from the proof technique.
Abstract
Consider a L\'evy process over an exponentially distributed time with mean . We study the joint distribution of the running maximum and the time epoch ) at which this maximum last occurs. Our main result is a fluctuation-theoretic distributional equality: the vector () can be written as a sum of two independent vectors, the first one being () and the second one being the running maximum and corresponding time epoch under the restriction that the L\'evy process is only observed at Poisson() inspection epochs (until ). We first provide an analytic proof for this remarkable decomposition, and then a more elementary proof that gives insight into the occurrence of the decomposition and into the fact that only appears in the right hand…
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
TopicsStochastic processes and financial applications · Advanced Queuing Theory Analysis · Statistical Distribution Estimation and Applications
