Generate independent and identically distributed random variables with probability density function , evaluate for each draw, and return the Monte Carlo estimator
Linearity of expectation makes this an unbiased estimator: . Independence and the specified variance give . Its Monte Carlo standard error is therefore , and the strong law of large numbers gives convergence to almost surely.
Apply Chebyshev's inequality to the Monte Carlo estimator:
Thus suffices, giving
This is a finite-sample probability guarantee for every target satisfying the given variance assumption. It is a sufficient sample count supplied by the inequality, rather than a claim that every such target actually needs a million draws.
The central limit theorem gives , so, with the cumulative distribution function of the standard normal distribution,
The error has two tails. Using the supplied quantile, whose two-sided coverage is approximately , gives
The supplied quantile would be appropriate for a one-sided calculation; it would give only approximately two-sided coverage. Using the exact quantile instead of would give draws; we consistently use the paper's rounded value below.
For routine Monte Carlo integration, the central limit theorem calculation is preferable as a practical budget: it uses about one fifteenth as many draws as the Chebyshev's inequality bound. However, its coverage is approximate. Finite variance alone supplies no universal rate of convergence to the normal distribution; an integrand with large skewness or a heavy-tailed distribution can make the approximation poor even at a large sample count. If an unconditional finite-sample guarantee is required under only the stated assumptions, use the Chebyshev's inequality budget.

Articles by others on the same topic (0)

There are currently no matching articles.