On a random recursion related to absorption times of death Markov chains
Abstract
Let X1,X2,... be a sequence of random variables satisfying the distributional recursion X1=0 and Xn= Xn-In+1 for n=2,3,..., where In is a random variable with values in \1,...,n-1\ which is independent of X2,...,Xn-1. The random variable Xn can be interpreted as the absorption time of a suitable death Markov chain with state space N:=\1,2,...\ and absorbing state 1, conditioned that the chain starts in the initial state n. This paper focuses on the asymptotics of Xn as n tends to infinity under the particular but important assumption that the distribution of In satisfies P\In=k\=pk/(p1+...+pn-1) for some given probability distribution pk= P\=k\, k∈ N. Depending on the tail behaviour of the distribution of , several scalings for Xn and corresponding limiting distributions come into play, among them stable distributions and distributions of exponential integrals of subordinators. The methods used in this paper are mainly probabilistic. The key tool is a coupling technique which relates the distribution of Xn to a random walk, which explains, for example, the appearance of the Mittag-Leffler distribution in this context. The results are applied to describe the asymptotics of the number of collisions for certain beta-coalescent processes.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.