Mathematics – Statistics Theory
Scientific paper
2006-12-17
Mathematics
Statistics Theory
Major Revision 15 pages, 4 figures
Scientific paper
This paper introduces an open-ended sequential algorithm for computing the p-value of a test using Monte Carlo simulation. It guarantees that the resampling risk, the probability of a different decision than the one based on the theoretical p-value, is uniformly bounded by an arbitrarily small constant. Previously suggested sequential or non-sequential algorithms, using a bounded sample size, do not have this property. Although the algorithm is open-ended, the expected number of steps is finite, except when the p-value is on the threshold between rejecting and not rejecting. The algorithm is suitable as standard for implementing tests that require (re-)sampling. It can also be used in other situations: to check whether a test is conservative, iteratively to implement double bootstrap tests, and to determine the sample size required for a certain power.
No associations
LandOfFree
Sequential Implementation of Monte Carlo Tests with Uniformly Bounded Resampling Risk does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sequential Implementation of Monte Carlo Tests with Uniformly Bounded Resampling Risk, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sequential Implementation of Monte Carlo Tests with Uniformly Bounded Resampling Risk will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-609763