Skip to main content
Let N ∼ Poisson(λ). You flip a coin a random number of times N. Each time a head will come with probability p, independently of N. Let X be the (random!) number of heads outcomes and Y be the (also random) number of tails. Find the distribution of X and Y . Hint: Conditioning on the value of N, the number of heads is a binomial random variable. Use the total probability theorem to conclude.








ANSWER


Here by the problem, 
N \sim Poisson (\lambda) with pmf,
f_N(n)=P(N=n)=e^{-\lambda}.\frac{\lambda^n}{n!} \ ,n=0,1,2,...
Now we flip a coin a random number N where each time a head will come with probability p ( and a tail will come with probability (1-p) , independently of N.
So here we assume X be the number of heads and Y =N-X be the number of tail.
Clearly we note that, X|N=n~Binomial(n,p) with pmf,
f_X(x|N=n)=\binom{n}{x}p^x(1-p)^{n-x} \ \ ,x=0,1,...,n
and similarly, Y|N=n~Binomial(n,1-p)
So the distribution of X (unconditional) is obtained as follows where we note that,
P(X=x)=\sum_n P(\left \{X=x \right \}\cap \left \{ N=n \right \})=\sum_n P(X=x| N=n )P(N=n)
Now clearly as 0\leq x\leq n then the lower limit of n be x , not 0.
                     =\sum _{n=x}^\infty \binom{n}{x}p^x(1-p)^{n-x} .e^{-\lambda}.\frac{\lambda^n}{n!}=e^{-\lambda}\lambda^x p^x\sum _{n=x}^\infty \frac{n!}{x!(n-x)!} .\frac{[\lambda(1-p)]^{n-x}}{n!}
                    =\frac{e^{-\lambda}\lambda^x p^x}{x!}\sum _{n=x}^\infty \frac{[\lambda(1-p)]^{n-x}}{(n-x)!}
Let us assume z=n-x then z=0,1,2,.....
=\frac{e^{-\lambda}\lambda^x p^x}{x!}e^{\lambda(1-p)}=e^{-\lambda p}.\frac{(\lambda p)^x}{x!} \ \ ,x=0,1,2,....
So clearly, X\sim Poisson(\lambda p)
Similarly we can show Y\sim Poisson(\lambda (1-p)) ( As Y|N=n~Binomial(n,1-p) hence just like X it is just replaced p by 1-p)

Comments

Popular posts from this blog

Need answers for your academic questions?

Need answers for your academic questions? Ask them in the comment section below. Just type in the url link of your question in the comment section below. And get your answer ready in two formats. Hand written Screenshot We will post the answer as soon as we get them (questions) Thank you..
Question: prove by induction 2^2 + 4^2 + 6^2 + ... + (2n)^2 = (2n)(2n+1)(2n+2)/6 ANSWER we will use induction on n base case : n=1 we have, 2^2 = 2*3*4/6 = 4 which is true inductive hypothesis let it be true for n = k i.e.,  2^2 + 4^2 + ... + (2k)^2 =   [(2k)(2k+1)(2k+2)]/6 inductive case let n = k+1 then we have 2^2 + 4^2 + .... + (2k)^2 + (2(k+1))^2 =   [(2k)(2k+1)(2k+2)]/6 + (2k+2)^2 =(2k+2)*[(2k)(2k+1)/6 + (2k+2)] =(2k+2)*[ (4k^2+2k)/6 + (12k + 12)/6 ] =(2k+2)*[ (4k^2+14k+12)/6 ] = =(2k+2)*[(2k)(2k+1)/6 + (2k+2)] =(2k+2)*[ (4k^2+2k)/6 + (12k + 12)/6 ] =(2k+2)*[ (4k^2+14k+12)/6 ] = (2k+2)*[ (4k^2 + 8k + 6k + 12)/6 ] = (2k+2)*[ (4k(k + 2) +6(k+2))/6 ] = (2k+2)*[ (4k+6)(k+2)/6 ] =  (2k+2)*[ 2 (2k+3)(k+2)/6  ] =   (2k+2)*[  (2k+3)*2*(k+2)/6  ] =   (2k+2)*[  (2k+3)(2k+4)/6  ] = [(2*(k+1))(2*(k+1)+1)(2*(k+1)+2)]/6 replacing k+1 by m, we get replacing k+1 by m, we get [(2*m)(2*m+1)(2*m+2)]/6 this completes our proof b...

Get assignments and case studies solved...

Hey Guys! Checkout our new site, https://caseaments.blogspot.com/  , where you can get your assignments done at low rate. Just send us the assignment topic. Specify, what you all need, summary or step by step writing. Give us a dead-line and length of assignment. ( number of words) On the basis of that, you will be charged. Any subject, even you can send us case studies , and get them answered. Payment methods: PayPal Payoneer Mail us at earnwithmetoo@gmail.com with the above details for quick response. Or else, join Hangouts . email-id  earnwithmetoo@gmail.com