Abstract
Let {Ai:i≥ 1} be a sequence of non-negative random variables and letMbe the class of all probability measures on [0,∞]. Define a transformationTonMby lettingTμ be the distribution of ∑i=1∞AiZi, where theZiare independent random variables with distribution μ, which are also independent of {Ai}. Under first moment assumptions imposed on {Ai}, we determine exactly whenThas a non-trivial fixed point (of finite or infinite mean) and we prove that all fixed points have regular variation properties; under moment assumptions of order 1 + ε, ε > 0, we findallthe fixed points and we prove that all non-trivial fixed points have stable-like tails. Convergence theorems are given to ensure that each non-trivial fixed point can be obtained as a limit of iterations (byT) with an appropriate initial distribution; convergence to the trivial fixed points δ0and δ∞is also examined, and a result like the Kesten-Stigum theorem is established in the case where the initial distribution has the same tails as a stable law. The problem of convergence with an arbitrary initial distribution is also considered when there is no non-trivial fixed point. Our investigation has applications in the study of: (a) branching processes; (b) invariant measures of some infinite particle systems; (c) the model for turbulence of Yaglom and Mandelbrot; (d) flows in networks and Hausdorff measures in random constructions; and (e) the sorting algorithm Quicksort. In particular, it turns out that the basic functional equation in the branching random walk always has a non-trivial solution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.