 |
Discrete Mathematics & Theoretical Computer Science |
Dominique Gouyou-Beauchamps ; Cyril Nicaud - Random Generation Using Binomial Approximations
dmtcs:2772 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) - https://doi.org/10.46298/dmtcs.2772Random Generation Using Binomial ApproximationsArticle
Authors: Dominique Gouyou-Beauchamps 1; Cyril Nicaud 
2
- 1 Laboratoire de Recherche en Informatique
- 2 Laboratoire d'Informatique Gaspard-Monge
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.
Source: HAL:hal-01185570v1
Volume: DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Section: Proceedings
Published on: January 1, 2010
Imported on: January 31, 2017
Keywords: random generation,binomial distribution,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]
Consultation statistics
This page has been seen 256 times.
This article's PDF has been downloaded 837 times.