Simulating events of unknown probabilities via reverse time martingales

From MaRDI portal
Publication:5198664

DOI10.1002/RSA.20333zbMATH Open1236.60044arXiv0907.4018OpenAlexW2142828514MaRDI QIDQ5198664FDOQ5198664


Authors: Krzysztof Łatuszyński, Ioannis Kosmidis, Omiros Papaspiliopoulos, Gareth O. Roberts Edit this on Wikidata


Publication date: 9 August 2011

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Abstract: Assume that one aims to simulate an event of unknown probability sin(0,1) which is uniquely determined, however only its approximations can be obtained using a finite computational effort. 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 of generating an f(p)coin given a sequence X1,X2,... of independent tosses of a pcoin (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. In the case of diffusions, we obtain the algorithm of cite{BeskosRobertsEA1} as a specific instance of the generic framework developed here. In the case of the Bernoulli factory, our work offers a statistical understanding of the Nacu-Peres algorithm for f(p)=min2p,12varepsilon (which is central to the general question) and allows for its immediate implementation that avoids algorithmic difficulties of the original version.


Full work available at URL: https://arxiv.org/abs/0907.4018




Recommendations




Cites Work


Cited In (16)





This page was built for publication: Simulating events of unknown probabilities via reverse time martingales

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