Random generation using binomial approximations

MaRDI QIDQ2959917zbMATH OpenFDO

Authors Cyril Nicaud, Dominique Gouyou-Beauchamps

Publication date 10 February 2017

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0125

zbMATH Keywords

binomial distributionrandom generation

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics on words (68R15)

Recommendations

• Uniform generation of a Motzkin word
• The generation of random, binary unordered trees
• The generation of binary trees as a numerical problem
• Generating random binary trees -- a survey
• Random generation of trees and other combinatorial objects

Cited in

(7)

• scientific article; zbMATH DE number 4005426 (Why is no real title available?)
• Probabilistic divide-and-conquer: deterministic second half
• Holonomic equations and efficient random generation of binary trees
• A Random Version of Shepp's Urn Scheme
• Uniform generation of a Motzkin word
• scientific article; zbMATH DE number 1568867 (Why is no real title available?)
• scientific article; zbMATH DE number 1512196 (Why is no real title available?)

This page was built for publication: Random generation using binomial approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959917)