Scaling limit of critical random trees in random environment
Abstract
We consider Bienaym\'e-Galton-Watson trees in random environment, where each generation k is attributed a random offspring distribution μk, and (μk)k≥ 0 is a sequence of independent and identically distributed random probability measures. We work in the ``strictly critical'' regime where, for all k, the average of μk is assumed to be equal to 1 almost surely, and the variance of μk has finite expectation. We prove that, for almost all realizations of the environment (more precisely, under some deterministic conditions that the random environment satisfies almost surely), the scaling limit of the tree in that environment, conditioned to be large, is the Brownian continuum random tree. The habitual techniques used for standard Bienaym\'e-Galton-Watson trees, or trees with exchangeable vertices, do not apply to this case. Our proof therefore provides alternative tools.
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.