4
$\begingroup$

Let $Y$ be the number of heads in a an $X$ toss sequence of flipping a coin with probability $p$ of heads. Show that $Y \sim \mathrm{Pois}(p \lambda)$ if $X \sim \mathrm{Pois}(\lambda)$.

$\endgroup$
  • $\begingroup$ Hint: Use the law of total probability to calculate $P\{Y = k\}$ from $P\{Y = k\mid X = n\}$ and the known values of $P\{X = n\}$. $\endgroup$ – Dilip Sarwate Feb 19 '13 at 13:54
  • $\begingroup$ Sure. Right, so that's what I have been doing, but it's not obvious. $\endgroup$ – darksky Feb 19 '13 at 13:56
  • $\begingroup$ Further hint: Can you tell what is the value of $P\{Y=10\mid X = 4\}$? How about $P\{Y=10\mid X=15\}$? You will need to use the fact that for a specific $k$, $P\{Y=k\mid X=n\}$ is zero for some choices of $n$, cancel some factorial terms in the rest, and sum a series. $\endgroup$ – Dilip Sarwate Feb 19 '13 at 14:02
5
$\begingroup$

Note that $Y\mid X=x\sim\mathrm{bi}(x,p)$ for $x=0,1,\ldots$ and so $$ P(Y=k\mid X=x)=\binom{x}{k}p^k(1-p)^{x-k},\quad k=0,\ldots,x. $$ Thus $$ P(Y=k)=\sum_{x=k}^\infty P(Y=k\mid X=x)P(X=x)=\sum_{x=k}^\infty\frac{x!}{k!(x-k)!}p^k(1-p)^{x-k}\frac{\lambda^x}{x!}e^{-\lambda}, $$ which by letting $x!$ cancel out we can write as $$ \frac{p^k}{k!}e^{-\lambda}\sum_{x=k}^\infty \frac{1}{(x-k)!}(1-p)^{x-k}\lambda^x. $$ Now write $\lambda^x$ as $\lambda^{x-k}\lambda^k$ and do a change of index so the sum starts at $x=0$. Then you should end up with $$ \frac{(p\lambda)^k}{k!}e^{- p\lambda}. $$

| cite | improve this answer | |
$\endgroup$
  • $\begingroup$ Can you please show some outline of the steps needed to go from second to the third line? $\endgroup$ – darksky Feb 19 '13 at 14:34
  • $\begingroup$ @darksky The sum can be written as $$e^{-\lambda}{p^k\lambda^k\over k!}\sum_{j=0}^\infty {\bigl[((1-p)\lambda\bigr]^j\over j!}.$$(First cancel the $x!$. Then factor out $p^k e^{-\lambda}/k!$ and change indices in the sum.) $\endgroup$ – David Mitra Feb 19 '13 at 14:35
3
$\begingroup$

It is easiest to use probability generating functions $\mathcal{P}_Z(t) = \sum_{m=0}^\infty t^m \mathbb{P}\left(Z=m\right) = \mathbb{E}\left(t^Z\right)$. The probability generating function of a binomial random variable equals $\left(1-p + p t \right)^n$. Thus: $$ \mathcal{P}_Y(t) = \mathbb{E}\left(t^Y\right) = \mathbb{E}\left(\mathbb{E}\left(t^Y|X\right)\right) = \mathbb{E}\left( (1-p+t p)^X\right) = \mathcal{P}_X(1-p+ t p) = \exp\left(\lambda \left( \left(1-p + t p \right) -1 \right) \right) = \exp\left(\lambda p (t-1) \right) $$ The latter is the probability generating function of $\operatorname{Poi}\left(\lambda p \right)$.

| cite | improve this answer | |
$\endgroup$
  • 1
    $\begingroup$ Unfortunately, we haven't learned probability generating functions yet. $\endgroup$ – darksky Feb 19 '13 at 14:22

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.