Linear time sampling of Pólya trees
Abstract
We present an algorithm for exact-size sampling of uniformly random Pólya trees with linear expected runtime.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.