Problem Set to Solutions - Probability with Engineering Application | ECE 313, Assignments of Statistics

Material Type: Assignment; Class: Probability with Engrg Applic; Subject: Electrical and Computer Engr; University: University of Illinois - Urbana-Champaign; Term: Fall 2002;

Typology: Assignments

Pre 2010

Uploaded on 03/16/2009

koofers-user-x1z-1
koofers-user-x1z-1 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE/CS 313: Probability with Engineering Applications Fall 2002
Problem Set 7 Solutions
1. Maximum variance Bernoulli and binomial random variables
(a) The variance of the Bernoulli random variable Xis p(1 p) which is zero at each end of the interval
of possible values for p, [0,1]. The function is positive in between. The derivative of the function is 1 2p
which is zero precisely when p=1
2. So p=1
2maximizes the variance, and the maximum value is 1
4.
(b) The variance of the binomial random variable Yis np(1 p), a constant ntimes larger than the variance
in part (a). So by part (a), the variance of Yis also maximized by p=1
2, and the maximum variance is n
4.
2. Some calculations with the Poisson distribution
(a) Parameter nis the number of leaves on the tree at the beginning of the one minute observation interval,
and pis the probability that any given leaf will fall off during the observation interval.
(b) The estimator ˆ
λML is the value of λthat maximizes P[X= 12] = eλλ12
12! . Equivalently, it maximizes
eλλ12, or equivalently it maximizes the natural log of this quantity, λ+ 12 ln(λ). This expression tends
to −∞ as λ0 or λ . The derivative 1 + 12
λis zero only when λ= 12. Thus, ˆ
λML = 12.
(c)
P[X= 2|X3] = P[{X= 2} {X3}]
P[X3] =P[{X= 2}]
P[X3] =λ2/2
1 + λ+λ2
2+λ3
6
(The factors eλcancel out.)
3. On the shape of the Poisson distribution
Proposition 6.10If Xis a Poisson random variable with parameter λ, where λ > 0, then as kgoes from 0
to ,P{X=k}first increases monotonically and then decreases monotonically, reaching its largest value
when kis the largest integer less than or equal to λ.
Proof: We prove the proposition by considering P{X=k}/P{x=k1}and determining for what values
of kit is greater than or less than 1. Now,
P[{X=k}]
P[{X=k1}]=
eλλk
k!
eλλk1
(k1)!
=λ
k
Hence P{X=k} P{X=k1}if and only if kλ, and the proposition is proved.”
(This is essentially Proposition 6.1 and its proof in the limit n ,p0 with np =λfixed.)
4. Poisson approximation and the birthday paradox
(a) There are 365 kdates left to choose from, so the probability is 365k
365 .
(b) 1 ·364
365 ·363
365 ···365k+1
365
k P [all kdistinct] Poisson approximation
10 0.883052 0.884009
20 0.588562 0.594195
30 0.293684 0.303680
(c) P[E12] = 1
365 because given the birthday of the first student, the chances of the second student having
the same birthday is 1
365 .
P[E12E13 ] = 1
3652because given the birthday of the first student, the chances of both the second and third
student having the same birthday as the first student is 1
3652.
P[E12E13 E23] = 1
3652since the event E12E13E23 is identical to the event E12E13.
Yes, the events Eij are pairwise independent since P[EijEi0j0] = 1
3652=P[Eij]P[Ei0j0] whenever ij and i0j0
are distinct pairs with i < j and i0< j0.
No, the events are not independent since P[E12E13E23] = 1
36526=P[E12]P[E13 ]P[E23].
(d) The suggested approximation is P[X=k]exp(k
2/365) = exp(k(k1)
2×365 ). Numerical values are
indicated in the table.
pf2

Partial preview of the text

Download Problem Set to Solutions - Probability with Engineering Application | ECE 313 and more Assignments Statistics in PDF only on Docsity!

ECE/CS 313: Probability with Engineering Applications Fall 2002

Problem Set 7 Solutions

  1. Maximum variance Bernoulli and binomial random variables (a) The variance of the Bernoulli random variable X is p(1 − p) which is zero at each end of the interval of possible values for p, [0,1]. The function is positive in between. The derivative of the function is 1 − 2 p which is zero precisely when p = 12. So p = 12 maximizes the variance, and the maximum value is 14. (b) The variance of the binomial random variable Y is np(1 − p), a constant n times larger than the variance in part (a). So by part (a), the variance of Y is also maximized by p = 12 , and the maximum variance is n 4.
  2. Some calculations with the Poisson distribution (a) Parameter n is the number of leaves on the tree at the beginning of the one minute observation interval, and p is the probability that any given leaf will fall off during the observation interval.

(b) The estimator ˆλM L is the value of λ that maximizes P [X = 12] = e

−λλ 12 12!. Equivalently, it maximizes e−λλ^12 , or equivalently it maximizes the natural log of this quantity, −λ + 12 ln(λ). This expression tends

to −∞ as λ → 0 or λ → ∞. The derivative −1 + (^12) λ is zero only when λ = 12. Thus, ˆλM L = 12. (c)

P [X = 2|X ≤ 3] =

P [{X = 2} ∩ {X ≤ 3 }]

P [X ≤ 3]

P [{X = 2}]

P [X ≤ 3]

λ^2 / 2 1 + λ + λ 22 + λ 63

(The factors e−λ^ cancel out.)

  1. On the shape of the Poisson distribution “Proposition 6. 1 ′^ If X is a Poisson random variable with parameter λ, where λ > 0, then as k goes from 0 to ∞, P {X = k} first increases monotonically and then decreases monotonically, reaching its largest value when k is the largest integer less than or equal to λ. Proof: We prove the proposition by considering P {X = k}/P {x = k − 1 } and determining for what values of k it is greater than or less than 1. Now,

P [{X = k}] P [{X = k − 1 }]

e−λλk k! e−λλk−^1 (k−1)!

=

λ k

Hence P {X = k} ≥ P {X = k − 1 } if and only if k ≤ λ, and the proposition is proved.” (This is essentially Proposition 6.1 and its proof in the limit n → ∞, p → 0 with np = λ fixed.)

  1. Poisson approximation and the birthday paradox (a) There are 365 − k dates left to choose from, so the probability is 365365 − k.

(b) 1 · 364365 · 363365 · · · 365365 −k+

k P [all k distinct] Poisson approximation 10 0. 883052 0. 884009 20 0. 588562 0. 594195 30 0. 293684 0. 303680

(c) P [E 12 ] = 3651 because given the birthday of the first student, the chances of the second student having

the same birthday is 3651.

P [E 12 E 13 ] = 36512 because given the birthday of the first student, the chances of both the second and third

student having the same birthday as the first student is 36512.

P [E 12 E 13 E 23 ] = 36512 since the event E 12 E 13 E 23 is identical to the event E 12 E 13.

Yes, the events Eij are pairwise independent since P [Eij Ei′^ j′^ ] = 36512 = P [Eij ]P [Ei′^ j′^ ] whenever ij and i′j′ are distinct pairs with i < j and i′^ < j′. No, the events are not independent since P [E 12 E 13 E 23 ] = 36512 6 = P [E 12 ]P [E 13 ]P [E 23 ].

(d) The suggested approximation is P [X = k] ≈ exp(−

(k 2

/365) = exp(− k 2 (×k− 365 1) ). Numerical values are indicated in the table.

  1. Conditional lifetimes and the memoryless property of the geometric distribution

(a) P [X > 3] = 1 − p(3) = 0.8, P [X > 8 |X > 5] = P^ [{X> P 8 [X>}∩{5]X> 5 }]= P P^ [[X>X>8]5] = (^0).^060 = 0.

(So a five year old working battery is not equivalent to a new one!) (b) P [Y > 3] = P [miss first three shots] = (1 − p)^3. On the other hand,

P [Y > 8 |Y > 5] =

P [{Y > 8 } ∩ {Y > 5 }]

P [Y > 5]

P [Y > 8]

P [Y > 5]

(1 − p)^8 (1 − p)^5

= (1 − p)^3.

(A player that has missed five shots is equivalent to a player just starting to take shots.) (c) Y has a geometric distribution. (Part (b) illustrates the fact that the geometric distribution is the memoryless lifetime distribution on the positive integers.)

  1. Packet length choice for noisy channels (a) pS,packet = (1 − pe,Byte)n+h, because a packet is successful if and only if all n + h bytes are correctly received. (b) E[X] = nP [X = n] = npS,packet, so η = (^) n+nh pS,packet. (The term (^) nn+h accounts for the loss in efficiency due to the packet headers and the term pS,packet accounts for the fraction of packet transmissions that are successful.) (c) Very small n is not efficient due to header overhead, reflected in the factor (^) nn+h. (d) Very large n is not efficient due to very small packet success probability, reflected by the exponent n in the expression for pS,packet. (e) Using a small computer program to compute η for a range of n, we find that n = 53 maximizes η, though the value of η is nearly the same for all n near 53. The value n = 53 yields η ≈ 0 .151.
  2. Cumulative distribution functions (a) P [X ≤ 1] = 0. 55 (b) P [X > 1] = 1 − P [X ≤ 1] = 0. 45 (c) P [|X| ≤ 3] = P [X ≤ 3] − P [X ≤ −3] = 0. 65 − 0 .35 = 0.30. (d) P [X^2 ≤ 9] = P [|X| ≤ 3] = 0. 30. (See previous part.)