Efficient random sampling of binary and unary-binary trees via holonomic equations
From MaRDI portal
Publication:2402673
DOI10.1016/j.tcs.2017.07.009zbMath1374.68128arXiv1401.1140OpenAlexW2964329821MaRDI QIDQ2402673
Axel Bacher, Olivier Bodini, Alice Jacquot
Publication date: 13 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.1140
Related Items
Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution ⋮ Sampling planar tanglegrams and pairs of disjoint triangulations ⋮ Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- A linear-time algorithm for the generation of trees
- A calculus for the random generation of labelled combinatorial structures
- Uniform generation of a Motzkin word
- The random generation of underdiagonal walks
- Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications
- GFUN
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- On Buffon Machines and Numbers