Scaling limits of random Polya trees

Polya trees are rooted trees considered up to symmetry. We establish the convergence of large uniform random Polya 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 is based on a novel decomposition: it shows that the global shape of a random Polya 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.