Non-uniform random generation of generalized Motzkin paths
From MaRDI portal
Publication:2491216
DOI10.1007/s00236-006-0008-xzbMath1089.05004MaRDI QIDQ2491216
Olivier Roques, Srečko Brlek, Elisa Pergola
Publication date: 26 May 2006
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-006-0008-x
05A15: Exact enumeration problems, generating functions
Related Items
Non-redundant random generation algorithms for weighted context-free grammars, The height of two types of generalised Motzkin paths, Controlled non-uniform random generation of decomposable structures, The relevant prefixes of coloured Motzkin walks: an average case analysis
Cites Work
- A bijective approach to the area of generalized Motzkin paths
- A calculus for the random generation of labelled combinatorial structures
- Uniform generation of a Motzkin word
- The random generation of directed animals
- A combinatorial interpretation of the area of Schröder paths
- Some asymptotic formulas for lattice paths
- A problem of arrangements
- Generating Random Unlabelled Graphs
- Schröder's paths and random hierarchies
- Two bijections for the area of Dyck paths
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item