Graduation Year
2017
Date of Submission
4-2017
Document Type
Open Access Senior Thesis
Degree Name
Bachelor of Arts
Department
Mathematics
Reader 1
Mark Huber
Terms of Use & License Information
Rights Information
© 2017 Bo J Jones
Abstract
Approximation algorithms employing Monte Carlo methods, across application domains, often require as a subroutine the estimation of the mean of a random variable with support on [0,1]. One wishes to estimate this mean to within a user-specified error, using as few samples from the simulated distribution as possible. In the case that the mean being estimated is small, one is then interested in controlling the relative error of the estimate. We introduce a new (epsilon, delta) relative error approximation scheme for [0,1] random variables and provide a comparison of this algorithm's performance to that of an existing approximation scheme, both establishing theoretical bounds on the expected number of samples required by the two algorithms and empirically comparing the samples used when the algorithms are employed for a particular application.
Recommended Citation
Jones, Bo, "A New Approximation Scheme for Monte Carlo Applications" (2017). CMC Senior Theses. 1579.
https://scholarship.claremont.edu/cmc_theses/1579
Comments