Supriya Ghosh (Editor)

Binomial sum variance inequality

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

The binomial sum variance inequality states that the variance of the sum of binomially distributed random variables will always be less than or equal to the variance of a binomial variable with the same n and p parameters. In probability theory and statistics, the sum of independent binomial random variables is itself a binomial random variable if all the component variables share the same success probability. If success probabilities differ, the probability distribution of the sum is not binomial. The lack of uniformity in success probabilities across independent trials leads to a smaller variance. and is a special case of a more general theorem involving the expected value of convex functions. In some statistical applications, the standard binomial variance estimator can be used even if the component probabilities differ, though with a variance estimate that has an upward bias.

Contents

Inequality statement

Consider the sum, Z, of two independent binomial random variables, X ~ B(m0, p0) and Y ~ B(m1, p1), where Z = X + Y. Then, the variance of Z is less than or equal to its variance under the assumption that p0 = p1, that is, if Z had a binomial distribution. Symbolically, Var(Z) ≤ E[Z] (1 – E[Z] / (m0 + m1) ).

Proof. If Z has a binomial distribution with parameters n and p, then the expected value of Z, E[Z] = np and the variance of Z is equal to np(1 – p) or equivalently, Var(Z) = E[Z] (1 – E[Z] / n), where in this case, n = m0 + m1. The random variables X and Y are independent, therefore the variance of the sum is equal to the sum of the variances, that is, Var(Z) = E[X] (1 – E[X] / m0) + E[Y] (1 – E[Y] / m1). Thus, if we can show that, E[X] (1 – E[X] / m0) + E[Y] (1 – E[Y] / m1) ≤ E[Z] (1 – E[Z] / (m1+m0)), then we have proved the theorem. Simplifying this inequality yields, E[X](1 – E[X]/m0) + E[Y](1 – E[Y]/m1) ≤ (E[X] + E[Y])(1 – (E[X] + E[Y])/(m0 + m1)), which leads to the relation (m1E[X])2 – 2m0m1E[X]E[Y] + (m0 E[Y])2 ≥ 0, or equivalently, (m1E[X] – m0E[Y])2 ≥ 0, which is true for all independent binomial distributions that X and Y could take, because a square of a real number is always greater than or equal to zero.

Although this proof was developed for the sum of two variables, it is easily generalized to greater than two. Additionally, if the individual success probabilities are known, then the variance is known to take the form

Var ( Z ) = n p ¯ ( 1 p ¯ ) n s 2 ,

where s 2 = 1 n i = 1 n ( p i p ¯ ) 2 . This expression also implies that the variance is always less than that of the binomial distribution with p = p ¯ , because the standard expression for the variance is decreased by ns2, a positive number.

Applications

The inequality can be useful in the context of multiple testing, where many statistical hypothesis tests are conducted within a particular study. Each test can be treated as a Bernoulli variable with a success probability p. Consider the total number of positive tests as a random variable denoted by S. This quantity is important in the estimation of false discovery rates (FDR), which quantify uncertainty in the test results. If the null hypothesis is true for some tests and the alternative hypothesis is true for other tests, then success probabilities are likely to differ between these two groups. However, the variance inequality theorem states that if the tests are independent, the variance of S will be no greater than it would be under a binomial distribution.

References

Binomial sum variance inequality Wikipedia


Similar Topics