Limit theorems for a supercritical multi-type branching process with immigration in a random environment
Abstract
Let \Zni = (Zni(r))1 r d: n 0\ be a supercritical d-type branching process in an i.i.d. environment = (0, 1, …), starting from a single particle of type i. The offspring distribution at generation n depends on the environment n, and we denote by Mn = (Mn(i,j))1 i,j d the corresponding (random) mean matrix. Recently, Grama et al. (Ann. Appl. Probab. 33(2023) 1213-1251) extended the famous Kesten--Stigum theorem to the random environment case with d>1. They improved upon previous work by innovatively constructing a new normalized population process (Win). Under several simple assumptions, they proved that Win converges almost surely to a limit Wi, and that Wi is non-degenerate if and only if a EX+ X<∞ type condition holds. In this paper, we study the situation where an immigrant vector Yn joins the population Zni at each generation n 0; the distribution of Yn also depends on the environment n. Following the approach of Grama et al., we construct a normalized process (Win) for the model with immigration, establishing a Kesten--Stigum type theorem that characterizes the non-degeneracy of its almost sure limit. Moreover, we provide complete Lp-convergence criteria for (Win), treating separately the cases 1 < p < ∞ and 0 < p < 1. As an important byproduct, a sufficient condition for the boundedness of the maximal function n Wni is also obtained. Our results show that, under a mild restriction on the number of immigrants, the inclusion of immigration does not affect the almost sure convergence property of the original normalized process, but it does have an impact on the criterion for Lp convergence.
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.