Guaranteed Monte Carlo Methods for Bernoulli Random Variables

arXiv1411.1151MaRDI QIDQ6256136FDOQ6256136

Authors: Lan Jiang, Fred J. Hickernell 

Publication date: 4 November 2014

Abstract: Simple Monte Carlo is a versatile computational method with a convergence rate of $O(n^{-1/2})$. It can be used to estimate the means of random variables whose distributions are unknown. Bernoulli random variables, $Y$, are widely used to model success (failure) of complex systems. Here $Y=1$ denotes a success (failure), and $p=mathbbE(Y)$ denotes the probability of that success (failure). Another application of Bernoulli random variables is $$, where then $p$ is the probability of $$ lying in the region $R$. This article explores how estimate $p$ to a prescribed absolute error tolerance, $varepsilon$, with a high level of confidence, $1-alpha$. The proposed algorithm automatically determines the number of samples of $Y$ needed to reach the prescribed error tolerance with the specified confidence level by using Hoeffding's inequality. The algorithm described here has been implemented in MATLAB and is part of the Guaranteed Automatic Integration Library (GAIL).

This page was built for publication: Guaranteed Monte Carlo Methods for Bernoulli Random Variables

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