Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

Random Generation Using Binomial Approximations

Abstract

Generalizing an idea used by Alonso to generate uniformly at random Motzkin words, we outline an approach to build efficient random generators using binomial distributions and rejection algorithms. As an application of this method, we present random generators, both efficient and easy to implement, for partial injections and colored unary-binary trees.
Fichier principal
Vignette du fichier
dmAM0125.pdf (361) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01185570 , version 1 (20-08-2015)

Identifiers

Cite

Dominique Gouyou-Beauchamps, Cyril Nicaud. Random Generation Using Binomial Approximations. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.359-372, ⟨10.46298/dmtcs.2772⟩. ⟨hal-01185570⟩
338 View
1849 Download

Altmetric

Share

More