Watermelon uniform random generation with applications

DOI10.1016/S0304-3975(03)00218-4zbMATH Open1070.68111OpenAlexW2092702893MaRDI QIDQ1885015FDOQ1885015

Authors: 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

Recommendations

• An efficient generation method for uniformly distributed random numbers
• Some characterizations of the uniform distribution with applications to random number generation
• scientific article; zbMATH DE number 781100
• Discrete random variate generation using uniformization
• Toward a universal random number generator
• Uniform random number generation
• Uniformly distributed sequences in computer algebra or how to construct program generators of random numbers
• Randon number generators: metrics and tests for uniformity and randomness
• Analysis and synthesis of Ultra-uniform Pseudorandom Number Generators

zbMATH Keywords

Baxter permutationUniformRandomRealizerVicious walkersWatermelon

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Walks, walls, wetting, and melting
• Planar graphs and poset dimension
• Algebraic languages and polyominoes enumeration
• On the computational power of pushdown automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random vicious walks and random matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Stack words, standard tableaux and Baxter permutations
• Vicious walkers and Young tableaux I: without walls
• On topological aspects of orientations
• Orderly spanning trees with applications to graph encoding and graph drawing
• Baxter permutations
• Standard Young tableaux of height 4 and 5
• Another involution principle-free bijective proof of Stanley's hook-content formula
• Title not available (Why is that?)
• Uniform random generation of words of rational languages
• Return polynomials for non-intersecting paths above a surface on the directed square lattice
• Title not available (Why is that?)
• Title not available (Why is that?)
• Heads-or-tails drawing of Fibonacci words
• Random and uniform generation of words

Cited In (12)

• A benchmark set for the reconstruction of \(hv\)-convex discrete sets
• Watermelon stripes. A case for the clonal mosaic model in plants
• \(q\)-distributions on boxed plane partitions
• Shuffling algorithm for boxed plane partitions
• Top eigenvalue of a random matrix: large deviations and third order phase transition
• Non-intersecting Brownian walkers and Yang-Mills theory on the sphere
• Non-intersecting Brownian bridges in the flat-to-flat geometry
• Exact distribution of the maximal height of \(p\) vicious walkers
• Reunion probability of \(N\) vicious walkers: typical and large fluctuations for large \(N\)
• The height and range of watermelons without wall
• Two Bessel bridges conditioned never to collide, double Dirichlet series, and Jacobi theta function
• Sampling and counting 3-orientations of planar triangulations

Uses Software

• gmp

This page was built for publication: Watermelon uniform random generation with applications

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