




Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Solutions for a final exam in probability theory, covering topics such as average number of heads in coin tosses, independence of random variables, joint pmf of success times, markov chains, expected return in dice games, and poisson random variables with varying means.
Typology: Exams
1 / 8
This page cannot be seen from the preview
Don't miss anything!





Due:August 8th, 2011 Solve all the problems
In both cases calculate the average number of “Heads” among the first n tosses, and the average time you have to wait for the first “Head”.
Solution. 1. (a)
i=
E[N |p = pi]P(p = pi) =
i=
npi
(p 1 + p 2 + pi)
(b)
i=
E(T |p = pi)P(p = pi) =
i=
n=
nP(T = n|p = pi)
i=
n=
n(1 − pi)n−^1 pi =
i=
pi p^2 i
p 1
p 2
p 3
N = X 1 + · · · + Xn ⇒ EN = E(X 1 + · · · + Xn) = EX 1 + · · · + EXn.
Since EXk =
i=1 E(Xi|p^ =^ pi)P(p^ =^ pi) =^
1 3
i=1 pi, then
i=
pi + · · · +
i=
pi =
n 3
(p 1 + p 2 + p 3 ).
(b) Since P(Xi = 1) =
i=1 P(Xi^ = 1|p^ =^ pi)P(p^ =^ pi) =^
p 1 +p 2 +p 3 3 is independent of i, and Xi are independent, then T is a geometric random variable with parameter p = p^1 +p 32 +p^3. Therefore
p
p 1 + p 2 + p 3
Proof. We want to show that
P(Y 1 ∈ F, Y 2 ∈ G) = P(Y 1 ∈ F )P(Y 2 ∈ G),
for any event F and G. There are sets A 1 , A 2 such that
{Y 1 ∈ F } := {g 1 (X 1 , X 2 ) ∈ F } = {X 1 ∈ A 1 , X 2 ∈ A 2 }.
Similarly, there are sets A 3 , A 4 , such that
{Y 2 ∈ G} := {g 2 (X 3 , X 4 ) ∈ G} = {X 3 ∈ A 3 , X 4 ∈ A 4 }.
Therefore,
P(Y 1 ∈ F, Y 2 ∈ G) = P(Xi ∈ Ai, for i = 1, · · · , 4) = P(X 1 ∈ A 1 , X 2 ∈ A 2 )P(X 3 ∈ A 3 , X 4 ∈ A 4 ) = P(Y 1 ∈ F )P(Y 2 ∈ G).
This shows that Yn is a geometric random variable, with parameter p. Furthermore, we can write
P(Y 1 = l 1 , Y 2 = l 1 , · · · , Yn = ln) = P(Y 1 = l 1 ) × · · · × P(Yn = ln).
Therefore Y 1 , · · · , Yn are independent.
Solution. 1. No, because knowing the weather status of today, tomor- row’s weather is not independent of weather of yesterday.
Solution. Assume EiG denote the expected gain, when our strategy is to stop as soon as the sum is at least i, where possible i’s are 2, · · · , 12. Let’s calculate EiG.
EiG = Ei[G|S < i]P(S < i) + Ei[G|S ≥ i]P(S ≥ i)
∑^ i−^1
k=
Ei[G|S = k]P(S = k) +
k=i
Ei[G|S = k]P(S = k)
= Ei[G]
∑^ i−^1
k=2,k 6 =
P(S = k) +
k=i,k 6 =
kP(S = k),
where we exclude k = 7 because Ei[G|S = k] = 0, when k = 7. We can solve this equation for EiG. If we observe that P(S < i) =
EiG =
k=i,k 6 =7 kP(S^ =^ k) 1 −
∑i− 1 k=2,k 6 =0 P(S^ =^ k)^
The numerator, and the denominator, are both finite sums, and P(S = k) is easy to calculate. Therefore the numerical value of EiG is computable. The result will be Ei^ attains its largest value when i = 7 and i = 8.
(Hint: instead of P(λ < x) = 1 − e−x, first solve the problem for an easier case where P(λ = 2) =. and P(λ = 2.5) = .7. )
Solution. 1. Let L denote the number accidents of this person. We don’t know the mean λ associated to this person. But given λ = x, L is a Poisson random variable N with mean x. Therefore, P(L = 0|λ = x) = P(N = 0) = e−x. (0.1) By the total probability formula for the continuous random variable λ,
P(L = 0) =
0
P(L = 0|λ = x)pλ(x)dx,
where pλ(x) is the density of λ. Since P(λ < x) = 1 − e−x, then λ is an exponential random variable with mean 1. Then pλ(x) = e−x. We also know that given λ = x, then N is a Poisson random variable with mean x therefore P(L = 0) =
0
e−xe−xdx =. 5
P(A|B) =
Observe that A, and B are not independent, (if somebody had 10 acci- dents last year, he probably has a larger λ, and this means he is likely to have a few accidents this year too), however, conditionally on λ they are independent (Compare this with Example 1.21 on page 37 of your text). Therefore
P(A ∩ B) =
0
P(A ∩ B|λ = x)pλ(x)dx
0
P(A|λ = x)P(B|λ = x)pλ(x)dx =
0
e−^3 xdx =
Similarly, P(B) = 13 , then the final answer is 2/3.