Let $X\mid Y\thicksim\operatorname{Binomial}(Y,p)$, and let $Y\thicksim\operatorname{Binomial}(n,q)$. I have seen it written that:

Claim: $X$ is marginally $\operatorname{Binomial}(n,pq)$.

There is a simple justification: first, $Y$ members of the population are chosen at random with probability $q$, and then each of these is selected with probability $p$, so that each member is randomly selected in the end with probability $pq$. That is satisfying.

However, my computation of the marginal variance of $X$ disagrees with the answer that should be true if the claim above is true. If the claim above is true, we should have $\operatorname{var} X = npq(1-pq)$. However, I'm getting $$\begin{aligned} \operatorname{var} X &= E[\operatorname{var}(X\mid Y)] + \operatorname{var}(E[X\mid Y])\\ &=E[Yp(1-p)] + \operatorname{var}(pY)\\ &=np(1-p) + p^2 n q (1-q). \end{aligned}$$

This does not equal $npq(1-pq)$. To see this, plug in $p=0.5,q=0.5$, and in that case $npq(1-pq)=0.1875n$ and $np(1-p) + p^2 n q (1-q)=0.3125n$.

I'm wondering if someone can check my math, or point to any resource showing that $X$ is really marginally Bin(n,pq). Thanks.

  • 1
    $\begingroup$ I was skeptical, but it seems to be true. You can factor the joint mass function to be a product binomial(x | n, pq) * binomial(y - x | n - x, q * (1-p)/(1-pq)). The result is now immediate from summing out $Y$. This statements feels like it should have an obvious explanation, but I can't see it at a glance. $\endgroup$
    – guy
    Aug 14, 2021 at 20:56
  • 1
    $\begingroup$ Interesting! I was also skeptical, and I thought there should be overdispersion, which is why I calculated the variance in the hierarchical situation using law of total variance. I guess my computation must be wrong, but I can't see the error -- any chance you can spot it? $\endgroup$ Aug 14, 2021 at 21:00
  • 3
    $\begingroup$ @cwindolf Yes, since $EY=nq$, there is a missing $q$ in the first term in your final expression for $\operatorname{Var}X$. $\endgroup$ Aug 14, 2021 at 21:02
  • $\begingroup$ Thanks! Happy to accept as an answer if you post below. $\endgroup$ Aug 14, 2021 at 21:02

3 Answers 3


Write $Y = \sum_i B_i$ and $X = \sum_i A_i B_i$ where $A_i \sim \text{Bernoulli}(p)$ and $B_i \sim \text{Bernoulli}(q)$. Then $Y$ and $X$ have the joint distribution specified ($Y$ is obvious, and conditional on $Y$ we will have a sum of exactly $Y$ of the $B_i$'s), but clearly $A_i B_i \sim \text{Bernoulli}(pq)$ independently. Hence $X \sim \text{Binomial}(n, pq)$ marginally.


As Ben points out, you've made an algebraic error and the result is correct. This process is called binomial thinning and, if you search for that expression, you'll find many mentions of it in the published literature. The process applies not just to binomial random variables, but also to multinomial, Poisson and negative binomial. Suppose that we have binomial, Poisson or negative binomial random variables:

  • $Y_1\sim {\rm Binomial}(n,q)$
  • $Y_2\sim {\rm Poisson}(\lambda)$
  • $Y_3\sim {\rm Negative\ Binomial}(\mu,\phi)$, i.e., with mean $\mu$ and variance $\mu+\phi\mu^2$

We can view each of these random variables as counting events from a random process. Suppose now that the individual events are not all observed but are randomly intercepted so that on average $p$ of them get through and are observed while the others are lost. In other words, we "thin out" the random processes by keeping each of the original events with probability $p$:

  • $X_1|Y_1 \sim {\rm Binomial}(Y_1,p)$
  • $X_2|Y_2 \sim {\rm Binomial}(Y_2,p)$
  • $X_3|Y_3 \sim {\rm Binomial}(Y_3,p)$

The resulting "thinned" distributions have the following marginal distributions:

  • $X_1 \sim {\rm Binomial}(n,pq)$
  • $X_2 \sim {\rm Poisson}(p\lambda)$
  • $X_3 \sim {\rm Negative\ Binomial}(p\mu,\phi)$

The effect is to scale down the expected value of the distribution by factor $p$ without otherwise changing the distributional form.

An example of binomial thinning from my own use is the thinCounts function of the edgeR package ( https://rdrr.io/bioc/edgeR/man/thinCounts.html ) which can be used to generate RNA-seq read counts for reduced sequencing depths.

  • 2
    $\begingroup$ Thanks for the broader perspective, this is great. $\endgroup$ Aug 15, 2021 at 14:40

You have an algebraic error in your working --- since $\mathbb{E}(Y)=nq$ you should have:

$$\begin{align} \mathbb{V}(X) &= \mathbb{E}(\mathbb{V}(X\mid Y)) + \mathbb{V}(\mathbb{E}(X\mid Y)) \\[6pt] &= \mathbb{E}(Yp(1-p)) + \mathbb{V}(pY) \\[6pt] &= p(1-p) \mathbb{E}(Y) + p^2 \mathbb{V}(Y) \\[6pt] &= n q p(1-p) + p^2 n q (1-q) \\[6pt] &= n p q [(1-p) + p (1-q)] \\[6pt] &= n p q (1 - p q), \\[6pt] \end{align}$$

which matches the marginal variance of the distribution $\text{Bin}(n,pq)$.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.