Mathematics > Combinatorics
arXiv:2606.23439 (math)
[Submitted on 22 Jun 2026]
Abstract:We present an algorithm for exact-size sampling of uniformly random Pólya trees with linear expected runtime.
Submission history
From: Benedikt Stufler [view email]
[v1]
Mon, 22 Jun 2026 14:58:08 UTC (41 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

























