On the genealogy on conditioned stable L\'evy forest
Abstract
We give a realization of the stable L\'evy forest of a given size conditioned by its mass from the path of the unconditioned forest. Then, we prove an invariance principle for this conditioned forest by considering k independent Galton-Watson trees whose offspring distribution is in the domain of attraction of any stable law conditioned on their total progeny to be equal to n. We prove that when n and k tend towards +∞, under suitable rescaling, the associated coding random walk, the contour and height processes converge in law on the Skorokhod space respectively towards the "first passage bridge" of a stable L\'evy process with no negative jumps and its height process.
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.