A Burnside-process algorithm generates uniformly random Pólya trees in near-linear time, supported by a new product formula for permutation-invariant labeled trees.
Ziegler, Proofs from The Book , sixth ed., Springer, Berlin, 2018, See corrected reprint of the 1998 original [MR1723092], Including illustrations by Karl H
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An algorithm for uniform generation of unlabeled trees (P\'olya trees), with an extension of Cayley's formula
A Burnside-process algorithm generates uniformly random Pólya trees in near-linear time, supported by a new product formula for permutation-invariant labeled trees.