Random Stability of Random Variables

Abstract

For a random variable N = 0, 1, 2, … we study the following question: When does the sum of N many independent and identically distributed copies of a random variable X have the same law a a nontrivial rescaling of X? We show that such N-stable random variable exists if and only 1 < E[N] < ∞. Under an additional assumption E[N N] < ∞, we describe all N-stable X. We also study a converse problem: For a given X 0 with E[X] = 1, we study the set of all N such that X is N-stable. Distributions of N form a semigroup with respect to composition of probability generating functions. We show these probability generating functions need to commute with respect to composition. We present explicit families of composition semigroups. Equivalent formulations have appeared in difference forms, and this article aims to unify and extend them.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…