Solutions to Problem Set 7 in ECE 413 at University of Illinois, Fall 2006, Assignments of Statistics

The solutions to problem set 7 in the electrical and computer engineering (ece) 413 course at the university of illinois, fall 2006. The problems cover topics such as probability theory, markov chains, and hypothesis testing. The solutions involve calculating probabilities and determining the maximum likelihood and minimum error probability decisions.

Typology: Assignments

Pre 2010

Uploaded on 03/16/2009

koofers-user-qmd
koofers-user-qmd 🇺🇸

9 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
University of Illinois Fall 2006
ECE 413: Solutions to Problem Set 7
1. (a) Yes, Fred and Wilma always alternate in tossing. Note that a game is won by the winner tossing
a Head. The next toss starts a new game, and the loser goes first in the next game. Hence, Fred
and Wilma always alternate in tossing. Alternation holds even for the other game considered on
the exam in which the winner matches the previous toss. The winning toss of a game is considered
to be the first toss of the next game. Since the loser of a game gets to toss the coin immediately
after a winning toss (this toss by the loser of the previous game is the second toss of the next
game), Fred and Wilma still alternate in tossing.
(b) P(Fn+1) = 1
3P(Fn) + 2
3P(Wn) = 1
3P(Fn) + 2
3(1 P(Fn)) = 2
31
3P(Fn).
P(Wn+1) = 2
3P(Fn) + 1
3P(Wn) = 2
3(1 P(Wn)) + 1
3P(Wn) = 2
31
3P(Wn).
(c) Suppose that P(Fn) = a+nfor n1. Then we have that
a+n+1 =2
31
3a+nnα+1
3=24a
3for all n1.
In order for this to hold for all n > 1, it must be that α=1
3and a=1
2. Hence,
P(Fn) = 1
2+b1
3n
and since P(F1) = 2
3, we get that b=1
2. The calculation for P(Wn) is almost identical, except
that the initial condition P(W1) = 1
3gives a different value + 1
2for b. Hence, we get that
P(Fn) = 1
211
3nand P(Wn) = 1
21 + 1
3n.
Note that P(Fn)> P(Wn) for odd n, and P(Fn)< P (Wn) for even n.
(d) Since 1
3n0 as n , lim
n→∞
P(Fn) = lim
n→∞
P(Wn) = 1
2and the game is asymptotically fair.
2. (a) p0(86) = 90
86(0.9)86(0.1)4,p1(86) = 90
71(0.9)71(0.1)19. The likelihood ratio is p1(86)/p0(86)
0.027 and hence the ML decision is that the connecting flight is late.
(b) Repeat part (a) for the case when the gate agent observes that X= 96. Obviously p0(96) = 0,
while p1(96) = 90
81(0.9)81(0.1)9. The likelihood ratio is p1(86)/p0(86) = and hence the ML
decision is that the connecting flight is on time. In fact, it should be obvious that for X>90, the
ML decision is that the connecting flight is on time.
(c) The MAP decision rule is the same as the ML decision rule.
3. The likelihood matrix and joint probability matrices are as shown below, and the ML and MAP decision
rules are indicated by boldface entries.
Hypothesis Y= 1 Y= 2 Y= 3 P(Hi)Y= 1 Y= 2 Y= 3
H1:X= 1 0.80.1 0.1 0.50.40.05 0.05
H2:X= 2 0.05 0.90.05 0.25 0.0125 0.225 0.0125
H2:X= 3 0.15 0.05 0.80.25 0.0375 0.0125 0.2
Thus, the ML and MAP rules are the same in this case. Other a priori probabilities could make the
MAP rule different from the ML rule . ..
4. (a) The likelihood of a hit is P(H|F) = 2
5or P(H|C) = 1
4, or P(H|S) = 1
6depending on which
hypothesis is true. Since P(H|F) = 2
5is the largest, the maximum-likelihood decision is that it
was a fastball.
pf2

Partial preview of the text

Download Solutions to Problem Set 7 in ECE 413 at University of Illinois, Fall 2006 and more Assignments Statistics in PDF only on Docsity!

University of Illinois Fall 2006

ECE 413: Solutions to Problem Set 7

  1. (a) Yes, Fred and Wilma always alternate in tossing. Note that a game is won by the winner tossing a Head. The next toss starts a new game, and the loser goes first in the next game. Hence, Fred and Wilma always alternate in tossing. Alternation holds even for the other game considered on the exam in which the winner matches the previous toss. The winning toss of a game is considered to be the first toss of the next game. Since the loser of a game gets to toss the coin immediately after a winning toss (this toss by the loser of the previous game is the second toss of the next game), Fred and Wilma still alternate in tossing. (b) P (Fn+1) = 13 P (Fn) + 23 P (Wn) = 13 P (Fn) + 23 (1 − P (Fn)) = 23 − 13 P (Fn). P (Wn+1) = 23 P (Fn) + 13 P (Wn) = 23 (1 − P (Wn)) + 13 P (Wn) = 23 − 13 P (Wn).

(c) Suppose that P (Fn) = a + bαn^ for n ≥ 1. Then we have that

a + bαn+1^ =^2 3

a + bαn

⇒ bαn

α +^1 3

=^2 −^4 a 3 for all n ≥ 1.

In order for this to hold for all n > 1, it must be that α = − 13 and a = 12. Hence,

P (Fn) =

  • b

)n

and since P (F 1 ) = 23 , we get that b = − 12. The calculation for P (Wn) is almost identical, except that the initial condition P (W 1 ) = 13 gives a different value + 12 for b. Hence, we get that

P (Fn) =

[

)n] and P (Wn) =

[

)n] .

Note that P (Fn) > P (Wn) for odd n, and P (Fn) < P (Wn) for even n. (d) Since

3

)n → 0 as n → ∞, (^) nlim→∞ P (Fn) = (^) nlim→∞ P (Wn) =

and the game is asymptotically fair.

  1. (a) p 0 (86) =

(0.9)^86 (0.1)^4 , p 1 (86) =

(0.9)^71 (0.1)^19. The likelihood ratio is p 1 (86)/p 0 (86) ≈ 0 .027 and hence the ML decision is that the connecting flight is late. (b) Repeat part (a) for the case when the gate agent observes that X = 96. Obviously p 0 (96) = 0, while p 1 (96) =

(0.9)^81 (0.1)^9. The likelihood ratio is p 1 (86)/p 0 (86) = ∞ and hence the ML decision is that the connecting flight is on time. In fact, it should be obvious that for X > 90, the ML decision is that the connecting flight is on time. (c) The MAP decision rule is the same as the ML decision rule.

  1. The likelihood matrix and joint probability matrices are as shown below, and the ML and MAP decision rules are indicated by boldface entries. Hypothesis Y = 1 Y = 2 Y = 3 P (Hi) Y = 1 Y = 2 Y = 3 H 1 : X = 1 0. 8 0. 1 0. 1 0. 5 0. 4 0. 05 0. 05 H 2 : X = 2 0. 05 0. 9 0. 05 0. 25 0. 0125 0. 225 0. 0125 H 2 : X = 3 0. 15 0. 05 0. 8 0. 25 0. 0375 0. 0125 0. 2

Thus, the ML and MAP rules are the same in this case. Other a priori probabilities could make the MAP rule different from the ML rule...

  1. (a) The likelihood of a hit is P (H|F ) = 25 or P (H|C) = 14 , or P (H|S) = 16 depending on which hypothesis is true. Since P (H|F ) = 25 is the largest, the maximum-likelihood decision is that it was a fastball.

(b) We know from Problem Set 6 that P (F ) = 245 , P (C) = 1024 and P (S) = 249. Now we compare the joint probabilities

P (H|F )P (F ) =

×

, P (H|C)P (C) =

×

, and P (H|S)P (S) =

×

to get the Bayesian decision that it was a curveball. Note that it is not necessary to find the a posteriori probabilities P (F |H), P (C|H), and P (S|H) explicitly; the joint probabilities suffice.

  1. (a) The maximum-likelihood decision rule is indicated by shading in the likelihood matrix below.

Hypothesis X = 3 X = 6 X = 9 X = 12 H 0 : excellent 0. 02 0. 08 0. 15 0. 75 H 1 : good 0. 10 0. 15 0. 60 0. 15 H 2 : average 0. 20 0. 65 0. 10 0. 05 (b) P (excellent student is labeled as good) = P (X = 9|H 0 ) = 0.15. P (excellent student is labeled as average) = P ({X = 6} ∪ {X = 3}|H 0 ) = 0.02 + 0.08 = 0.1. P (average student is labeled as good or excellent ) = P ({X = 9} ∪ {X = 12}|H 2 ) = 0.15. (c) The conditional error probabilities of the maximum-likelihood decision rule are P (E|H 0 ) = 0.25, P (E|H 1 ) = 0.4, P (E|H 2 ) = 0.15. Hence, the error probability is P (E) = P (E|H 0 )π 0 + P (E|H 1 )π 1 + P (E|H 2 )π 2 = 0.05 + 0.22 + .0375 = 0. 3075.

(d) The joint probability matrix is as shown below together with the MAP decision rule. Hypothesis X = 3 X = 6 X = 9 X = 12 H 0 : excellent 0. 0040 0. 0160 0. 0300 0. 1500 H 1 : good 0. 0550 0. 0825 0. 3300 0. 0825 H 2 : average 0. 0500 0. 1625 0. 0250 0. 0125 P (E) = 1 − (0.15 + 0.33 + 0.1625 + 0.055) = 0.3025 which is slightly smaller than that of the maximum-likelihood rule. But note that students getting D’s are classified as good while students getting C’s are classified as average. Holy capricious grading complaint, Batman! (e) Now the joint probability matrix looks as shown below, and all students are classified as excellent regardless of their grade on the exam! Hypothesis X = 3 X = 6 X = 9 X = 12 H 0 : excellent 0. 0190 0. 0760 0. 1425 0. 7125 H 1 : good 0. 0050 0. 0075 0. 0003 0. 0075 H 2 : average 0. 0000 0. 000 0. 0000 0. 0000 Obviously, there is no need for examinations at the Lake Wobegon campus since the results are ignored anyway.

Noncredit exercise: Write a letter to the Governor asking him to demand that the University adopt the Lake Wobegon approach and eliminate all exams as a cost-cutting measure...