Perfect simulation from the quicksort limit distribution
From MaRDI portal
Publication:1572752
DOI10.1214/ECP.v5-1024zbMath0958.65012MaRDI QIDQ1572752
James Allen Fill, Ralph Neininger, Luc P. Devroye
Publication date: 27 July 2000
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120892
sortingMonte Carlo methodfixed-point equationrandom variate generationrejection methodquicksort algorithm
Searching and sorting (68P10) Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10)
Related Items (7)
Approximating perpetuities ⋮ Density functions for \texttt{QuickQuant} and \texttt{QuickVal} ⋮ Exact and approximate limit behaviour of the Yule tree's cophenetic index ⋮ Complexity Questions in Non-Uniform Random Variate Generation ⋮ On the silhouette of binary search trees ⋮ Stochastic fixed-point equations ⋮ Convergence of the population dynamics algorithm in the Wasserstein metric
This page was built for publication: Perfect simulation from the quicksort limit distribution
