An algorithm for uniform generation of unlabeled trees (Pólya trees), with an extension of Cayley's formula

Pólya trees are rooted, unlabeled trees on $n$ vertices. This paper gives an efficient, new way to generate Pólya trees. This allows comparing typical unlabeled and labeled tree statistics and comparing asymptotic theorems with `reality’. Along the way, we give a product formula for the number of rooted labeled trees preserved by a given automorphism; this refines Cayley’s formula.