The random generation of underdiagonal walks

DOI10.1016/0012-365X(94)00121-XzbMath0821.60079MaRDI QIDQ1893974

Elena Barcucci, Renzo Sprugnoli, Renzo Pinzani

Publication date: 27 September 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random generation of underdiagonal walks

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Related Items

Riordan arrays and combinatorial sums, Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution, Uniform random generation of words of rational languages, Probabilistic analysis of some (un)directed animals, Decomposition and group theoretic characterization of pairs of inverse relations of the Riordan type, Efficient random sampling of binary and unary-binary trees via holonomic equations, Random and uniform generation of words, Random generation of words in an algebraic language in linear binary space, The relevant prefixes of coloured Motzkin walks: an average case analysis, Asymptotic properties of some underdiagonal walks generation algorithms

Uses Software

• Maple

Cites Work

• Unnamed Item
• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• Uniform Random Generation of Strings in a Context-Free Language
• Asymptotic Methods in Enumeration
• On context-free languages and push-down automata
• Motzkin numbers