arXiv Analytics

Sign in

arXiv:1711.07288 [math.PR]AbstractReferencesReviewsResources

When Fourth Moments Are Enough

Chris Jennings-Shaffer, Dane R. Skinner, Edward C. Waymire

Published 2017-11-20Version 1

This note concerns a somewhat innocent question motivated by an observation concerning the use of Chebyshev bounds on sample estimates of $p$ in the binomial distribution with parameters $n,p$. Namely, what moment order produces the best Chebyshev estimate of $p$? If $S_n(p)$ has a binomial distribution with parameters $n,p$, there it is readily observed that ${\rm argmax}_{0\le p\le 1}{\mathbb E}S_n^2(p) = {\rm argmax}_{0\le p\le 1}np(1-p) = \frac12,$ and ${\mathbb E}S_n^2(\frac12) = \frac{n}{4}$. Rabi Bhattacharya observed that while the second moment Chebyshev sample size for a $95\%$ confidence estimate within $\pm 5$ percentage points is $n = 2000$, the fourth moment yields the substantially reduced polling requirement of $n = 775$. Why stop at fourth moment? Is the argmax achieved at $p = \frac12$ for higher order moments and, if so, does it help, and compute $\mathbb{E}S_n^{2m}(\frac12)$? As captured by the title of this note, answers to these questions lead to a simple rule of thumb for best choice of moments in terms of an effective sample size for Chebyshev concentration inequalities.

Related articles: Most relevant | Search more
arXiv:2008.01125 [math.PR] (Published 2020-08-03)
Monotonicity properties of the Poisson approximation to the binomial distribution
arXiv:2009.12641 [math.PR] (Published 2020-09-26)
A q-analog of the binomial distribution
arXiv:2004.03280 [math.PR] (Published 2020-04-07)
Uniqueness of a Median of a Binomial Distribution with Rational Probability