2000 character limit reached
Scaling limits of random Pólya trees
Published 25 Feb 2015 in math.PR and math.CO | (1502.07180v2)
Abstract: P\'olya trees are rooted trees considered up to symmetry. We establish the convergence of large uniform random P\'olya trees with arbitrary degree restrictions to Aldous' Continuum Random Tree with respect to the Gromov-Hausdorff metric. Our proof is short and elementary, and it shows that the global shape of a random P\'olya tree is essentially dictated by a large Galton-Watson tree that it contains. We also derive sub-Gaussian tail bounds for both the height and the width, which are optimal up to constant factors in the exponent.
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.