arXiv Analytics

Sign in

arXiv:1006.0042 [stat.CO]AbstractReferencesReviewsResources

Computing the confidence levels for a root-mean-square test of goodness-of-fit

William Perkins, Mark Tygert, Rachel Ward

Published 2010-06-01, updated 2011-03-07Version 7

The classic chi-squared statistic for testing goodness-of-fit has long been a cornerstone of modern statistical practice. The statistic consists of a sum in which each summand involves division by the probability associated with the corresponding bin in the distribution being tested for goodness-of-fit. Typically this division should precipitate rebinning to uniformize the probabilities associated with the bins, in order to make the test reasonably powerful. With the now widespread availability of computers, there is no longer any need for this. The present paper provides efficient black-box algorithms for calculating the asymptotic confidence levels of a variant on the classic chi-squared test which omits the problematic division. In many circumstances, it is also feasible to compute the exact confidence levels via Monte Carlo simulation.

Comments: 19 pages, 8 figures, 3 tables
Journal: Applied Mathematics and Computation, 217 (22): 9072-9084, 2011
Categories: stat.CO, stat.ME
Related articles: Most relevant | Search more
arXiv:1009.2260 [stat.CO] (Published 2010-09-12, updated 2011-12-22)
Computing the confidence levels for a root-mean-square test of goodness-of-fit, II
arXiv:0809.4047 [stat.CO] (Published 2008-09-23)
Improved Sequential Stopping Rule for Monte Carlo Simulation
arXiv:1906.07684 [stat.CO] (Published 2019-06-18)
Monte Carlo simulation on the Stiefel manifold via polar expansion