Simulating Events of Unknown Probabilities via Reverse Time Martingales.
RANDOM STRUCT ALGOR
441 - 452.
Let s is an element of (0, 1) be uniquely determined but only its approximations can be obtained with a finite computational effort. Assume one aims to simulate an event of probability s. Such settings are often encountered in statistical simulations. We consider two specific examples. First, the exact simulation of non-linear diffusions (). Second, the celebrated Bernoulli factory problem ([10, 13]) of generating an f (p)-coin given a sequence X-1, X-2, ... of independent tosses of a p-coin (with known f and unknown p). We describe a general framework and provide algorithms where this kind of problems can be fitted and solved. The algorithms are straightforward to implement and thus allow for effective simulation of desired events of probability s. Our methodology links the simulation problem to existence and construction of unbiased estimators. (C) 2010 Wiley Periodicals, Inc. Random Struct. Alg., 38, 441-452, 2011
|Title:||Simulating Events of Unknown Probabilities via Reverse Time Martingales|
|Keywords:||perfect simulation, Bernoulli factory, retrospective sampling, unbiased simulation|
|UCL classification:||UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Maths and Physical Sciences
Archive Staff Only