Selfdecomposability, perpetuity and stopping times
Zbigniew J. Jurek

TL;DR
This paper explores the connection between selfdecomposable distributions, stopping times, and perpetuity laws, demonstrating that all selfdecomposable distributions can be represented as perpetuities, with implications for stochastic analysis in Banach spaces.
Contribution
It introduces a novel approach to incorporate stopping times into the theory of selfdecomposable distributions using random integrals, and shows all such distributions are perpetuities.
Findings
Selfdecomposable distributions are perpetuities.
Stopping times can be used in the analysis of limit distributions.
Applications to Banach space-valued random variables.
Abstract
In the probability theory limit distributions (or probability measures) are often characterized by some convolution equations (factorization properties) rather than by Fourier transforms (the characteristic functionals). In fact, usually the later follows the first one. Equations, in question, involve the multiplication by the positive scalars or an action of the corresponding dilation on measures. In such a setting, it seems that there is no way for stopping times (or in general, for the stochastic analysis) to come into the "picture". However, if one accepts the view that the primary objective, in the classical limit distributions theory, is to describe the limiting distributions (or random variables) by the tools of random integrals/functionals then one can use the stopping times. In this paper we illustrate such a possibility in the case of selfdecomposability random…
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 · Probability and Risk Models · Stochastic processes and statistical mechanics
