Fast perfect simulation of Vervaat perpetuities

[1]  K. Dickman On the frequency of numbers containing prime factors of a certain relative magnitude , 1930 .

[2]  C. A. R. Hoare,et al.  Algorithm 65: find , 1961, Commun. ACM.

[3]  P. Feder,et al.  STOCHASTIC DIFFERENCE EQUATIONS OCCURRING IN ONE-COMPARTMENT MODELS , 1966 .

[4]  P. Feder,et al.  Random difference equations occuring in one-compartment models☆ , 1967 .

[5]  W. Vervaat On a stochastic difference equation and a representation of non–negative infinitely divisible random variables , 1979, Advances in Applied Probability.

[6]  George S. Fishman,et al.  Choosing sample path length and number of sample paths when starting in steady state , 1994, Oper. Res. Lett..

[7]  Hosam M. Mahmoud,et al.  Analysis of Quickselect: An Algorithm for Order Statistics , 1995, RAIRO Theor. Informatics Appl..

[8]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[9]  Wilfrid S. Kendall,et al.  Perfect Simulation for the Area-Interaction Point Process , 1998 .

[10]  W. Kendall,et al.  Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes , 2000, Advances in Applied Probability.

[11]  Luc Devroye,et al.  Simulating Perpetuities , 2001 .

[12]  Hsien-Kuei Hwang,et al.  Quickselect and the Dickman Function , 2002, Combinatorics, Probability and Computing.

[13]  James Allen Fill,et al.  Perfect Simulation of Vervaat Perpetuities , 2009 .

[14]  Luc Devroye,et al.  Simulating the Dickman distribution , 2010 .

[15]  J. Blanchet,et al.  On exact sampling of stochastic perpetuities , 2011, Journal of Applied Probability.