Sciweavers

Share
CALDAM
2016

Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications

3 years 2 months ago
Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications
In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisfies a given partition of degrees. This new version is now optimal in terms of random bit complexity, up to a multiplicative constant. We then apply a natural process “simulate-guess-and-proof” to analyze the height of a random Motzkin in function of its frequency of unary nodes. When the number of unary nodes dominate, we prove some unconventional height phenomena (i.e. outside the universal Θ( √ n) behaviour.)
Olivier Bodini, David Julien, Philippe Marchal
Added 31 Mar 2016
Updated 31 Mar 2016
Type Journal
Year 2016
Where CALDAM
Authors Olivier Bodini, David Julien, Philippe Marchal
Comments (0)
books