Watermelon uniform random generation with applications

DOI10.1016/S0304-3975(03)00218-4zbMath1070.68111OpenAlexW2092702893MaRDI QIDQ1885015

Nicolas Bonichon, Mohamed Mosbah

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00218-4

zbMATH Keywords

Baxter permutationUniformRandomRealizerVicious walkersWatermelon

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorics in computer science (68R05)

Related Items

\(q\)-distributions on boxed plane partitions ⋮ Reunion probability of \(N\) vicious walkers: typical and large fluctuations for large \(N\) ⋮ Non-intersecting Brownian walkers and Yang-Mills theory on the sphere ⋮ Two Bessel bridges conditioned never to collide, double Dirichlet series, and Jacobi theta function ⋮ Top eigenvalue of a random matrix: large deviations and third order phase transition ⋮ The height and range of watermelons without wall ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Non-intersecting Brownian bridges in the flat-to-flat geometry ⋮ Sampling and Counting 3-Orientations of Planar Triangulations ⋮ Shuffling algorithm for boxed plane partitions ⋮ Exact Distribution of the Maximal Height of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>p</mml:mi></mml:math>Vicious Walkers

Uses Software

• gmp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Walks, walls, wetting, and melting
• Standard Young tableaux of height 4 and 5
• Planar graphs and poset dimension
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Algebraic languages and polyominoes enumeration
• Uniform random generation of words of rational languages
• Another involution principle-free bijective proof of Stanley's hook-content formula
• Heads-or-tails drawing of Fibonacci words
• Random and uniform generation of words
• Stack words, standard tableaux and Baxter permutations
• On the computational power of pushdown automata
• Return polynomials for non-intersecting paths above a surface on the directed square lattice
• Vicious walkers and Young tableaux I: without walls
• Baxter permutations
• On topological aspects of orientations