Probabilistic Analysis of Algorithms

Author(s):  
Jon Louis Bentley ◽  
George S. Lueker
2002 ◽  
Vol 34 (2) ◽  
pp. 441-468 ◽  
Author(s):  
Luc Devroye ◽  
Ralph Neininger

An algorithm is developed for exact simulation from distributions that are defined as fixed points of maps between spaces of probability measures. The fixed points of the class of maps under consideration include examples of limit distributions of random variables studied in the probabilistic analysis of algorithms. Approximating sequences for the densities of the fixed points with explicit error bounds are constructed. The sampling algorithm relies on a modified rejection method.


2002 ◽  
Vol 34 (02) ◽  
pp. 441-468 ◽  
Author(s):  
Luc Devroye ◽  
Ralph Neininger

An algorithm is developed for exact simulation from distributions that are defined as fixed points of maps between spaces of probability measures. The fixed points of the class of maps under consideration include examples of limit distributions of random variables studied in the probabilistic analysis of algorithms. Approximating sequences for the densities of the fixed points with explicit error bounds are constructed. The sampling algorithm relies on a modified rejection method.


Sign in / Sign up

Export Citation Format

Share Document