2000 character limit reached
Scaling limit of trees with vertices of fixed degrees and heights
Published 19 Sep 2024 in math.PR | (2409.12897v2)
Abstract: We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths from random vertices to the root using coalescent processes. As an application, we obtain scaling limits of Bienaym\'e-Galton-Watson trees in varying environment.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.