ECE313 Summer Problem Set 7. Reading: Cond. Prob., Law of total prob., Hypothesis testinng Quiz Date: Tuesday, July 3

Similar documents
PROBABILITY.

ECE 313: Conflict Final Exam Tuesday, May 13, 2014, 7:00 p.m. 10:00 p.m. Room 241 Everitt Lab

Topic 5: Probability. 5.4 Combined Events and Conditional Probability Paper 1

Introduction to Probability 2017/18 Supplementary Problems

6.041/6.431 Spring 2009 Quiz 1 Wednesday, March 11, 7:30-9:30 PM. SOLUTIONS

Probability Theory and Applications

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

Edexcel past paper questions

The enumeration of all possible outcomes of an experiment is called the sample space, denoted S. E.g.: S={head, tail}

STAT 285 Fall Assignment 1 Solutions

Discrete Random Variable

Basic Probabilistic Reasoning SEG

Independence 1 2 P(H) = 1 4. On the other hand = P(F ) =

Problems for 2.6 and 2.7

Cogs 14B: Introduction to Statistical Analysis

Deep Learning for Computer Vision

Probability and the Second Law of Thermodynamics

Exam 1. Problem 1: True or false

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu

SYDE 372 Introduction to Pattern Recognition. Probability Measures for Classification: Part I

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch

Name: Exam 2 Solutions. March 13, 2017

MAT 271E Probability and Statistics

RISKy Business: An In-Depth Look at the Game RISK

Problem Set 2 Due Feb, 1

ECE 541 Project Report: Modeling the Game of RISK Using Markov Chains

Ismor Fischer, 2/27/2018 Solutions / 3.5-1

LECTURE NOTES by DR. J.S.V.R. KRISHNA PRASAD

Exam III Review Math-132 (Sections 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 8.1, 8.2, 8.3)

4. Conditional Probability P( ) CSE 312 Autumn 2012 W.L. Ruzzo

STA 247 Solutions to Assignment #1

Probability Notes. Definitions: The probability of an event is the likelihood of choosing an outcome from that event.

Conditional Probability & Independence. Conditional Probabilities

What is Probability? Probability. Sample Spaces and Events. Simple Event

With Question/Answer Animations. Chapter 7

MATH 3C: MIDTERM 1 REVIEW. 1. Counting

Sample Space: Specify all possible outcomes from an experiment. Event: Specify a particular outcome or combination of outcomes.

Lecture notes for probability. Math 124

Discrete Random Variables. Discrete Random Variables

Final Exam. Math Su10. by Prof. Michael Cap Khoury

Topic 3: Introduction to Probability

Conditional Probability & Independence. Conditional Probabilities

CSC Discrete Math I, Spring Discrete Probability

Discrete Probability

1 The Basic Counting Principles

F71SM STATISTICAL METHODS

V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE

Unit II. Page 1 of 12

ECE313 Summer Problem Set 5. Note: It is very important that you solve the problems first and check the solutions. 0, if X = 2k, = 3.

STAT:5100 (22S:193) Statistical Inference I

Lecture 3 Probability Basics

18.05 Practice Final Exam

A Collection of Dice Problems

MATH HOMEWORK PROBLEMS D. MCCLENDON

Probability Theory and Statistics (EE/TE 3341) Homework 3 Solutions

Probability (Devore Chapter Two)

Midterm #1 - Solutions

Chapter 35 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.

M378K In-Class Assignment #1

Lecture 7. Union bound for reducing M-ary to binary hypothesis testing

ECEn 370 Introduction to Probability

Discrete Structures for Computer Science

1 Normal Distribution.

Midterm 2. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You:

Math 510 midterm 3 answers

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14

Math 122L. Additional Homework Problems. Prepared by Sarah Schott

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 1

Chapter 2. Binary and M-ary Hypothesis Testing 2.1 Introduction (Levy 2.1)

Probability Year 10. Terminology

Problems and results for the ninth week Mathematics A3 for Civil Engineering students

Introduction and basic definitions

Origins of Probability Theory

n(1 p i ) n 1 p i = 1 3 i=1 E(X i p = p i )P(p = p i ) = 1 3 p i = n 3 (p 1 + p 2 + p 3 ). p i i=1 P(X i = 1 p = p i )P(p = p i ) = p1+p2+p3

Probability 1 (MATH 11300) lecture slides

Problem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30

students all of the same gender. (Total 6 marks)

1 INFO 2950, 2 4 Feb 10

MTH302 Quiz # 4. Solved By When a coin is tossed once, the probability of getting head is. Select correct option:

Exam 1 - Math Solutions

Answers to All Exercises

MATH 19B FINAL EXAM PROBABILITY REVIEW PROBLEMS SPRING, 2010

Computations - Show all your work. (30 pts)

18.05 Final Exam. Good luck! Name. No calculators. Number of problems 16 concept questions, 16 problems, 21 pages

OCR Statistics 1 Probability. Section 1: Introducing probability

Digital Transmission Methods S

Bayesian Decision Theory

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Problem Set 3: Solutions Fall 2007

Conditional Probability and Bayes

Conditional Probability and Independence

MTH 245: Mathematics for Management, Life, and Social Sciences

Lecture Lecture 5

Term Definition Example Random Phenomena

Probability Year 9. Terminology

Intro to Probability. Andrei Barbu

Stat 225 Week 2, 8/27/12-8/31/12, Notes: Independence and Bayes Rule

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability

UNIT 5 ~ Probability: What Are the Chances? 1

4/17/2012. NE ( ) # of ways an event can happen NS ( ) # of events in the sample space

Decentralized Detection In Wireless Sensor Networks

Transcription:

ECE313 Summer 2012 Problem Set 7 Reading: Cond. Prob., Law of total prob., Hypothesis testinng Quiz Date: Tuesday, July 3 Note: It is very important that you solve the problems first and check the solutions afterwards. Problem 1 In the game of Risk, an attack is simulated by two players rolling dice. Player 1 rolls three red dice, and Player 2 rolls two white dice. Define the random variables R 1 and R 2 to be the largest and second largest numbers showing on the the red dice. Define W 1 and W 2 to be the higher and lower numbers shown on the white dice. Points (which represent armies) are deducted from the players as follows: outcome player 1 player 2 R 1 > W 1 and R 2 > W 2 0-2 R 1 > W 1 and R 2 W 2-1 -1 R 1 W 1 and R 2 > W 2-1 -1 R 1 W 1 and R 2 W 2-2 0 Define the random variables N 1 and N 2 to be the number of points deducted from Player 1 and Player 2, respectively. a) Determine the pmf for R 2. b) Compute the pmf for N 1. c) Compute the pmf for N 2. d) Determine the expected number of points deducted from each player at the end of three consecutive attacks. e) Suppose Player 2 has three armies. What is the expected number of attacks required to reduce his number of armies to zero (i.e., what is the expected number of attacks that will be required to penalize Player 2-3 points)? Problem 2 A baseball pitcher s repertoire is limited to fastballs (event F), curve balls (event C) or sliders (event S). It is known that P(C) 2P(F). The event H, that the batter hits the ball has the conditional probabilities P (H F) 2/5, P (H C) 1/4, and P (H S) 1/6. Furthermore, based on this pitcher s past performance, it is estimated that P(H) 1/4. a) Compute the probabilities for the three pitches: P(F), P(S), and P(C). b) A fan sitting in the bleachers sees the batter getting a hit (i.e., the fan observes that the event H occurs), but his seat is too far away to be able to tell which pitch was thrown. Compute the conditional probabilities for the three pitches: P (F H), P (C H), and P (S H). 1

Problem 3 The dice game of craps begins with the player (called the shooter) rolling two fair dice. If the sum is 2, 3, or 12, the shooter loses the game. If the sum is a 7 or 11, the shooter wins the game. If the sum is any of 4, 5, 6, 8, 9, 10, then the shooter has neither won nor lost (as yet). The number rolled is called the shooter s point, and what happens next is described below in part (b). a) What is the probability that the shooter wins the game on the first roll? What is the probability that the shooter loses the game on the first roll? What is the probability that the shooter s point is i,i {4,5,6,7,8,10}? b) Suppose that the shooter s point is i for i {4,5,6,7,8,10}. The shooter rolls the dice again. If the result is i, the shooter is said to have made the point and wins the game. If the result is 7, the shooter loses the game (craps out). If the result is anything else, the shooter rolls the dice again. This continues until the shooter either makes the point or craps out. For each i {4,5,6,7,8,10}, compute the probability that the shooter wins the game. Note that these are conditional probabilities of winning given that the shooter s point is i. c) Conditioned on the shooter s point being i, what is the expected number of dice rolls till the game ends? (Note: one dice roll rolling two dice simultaneously). What is the expected number of dice rolls in a game of craps? What is the (unconditional) probability of winning at craps? d) If the shooter s point is 8, then side-bets are offered at 10 to 1 odds that the shooter will make the point the hard way by rolling (4,4). Is this a fair bet? (Remember that 10 to 1 odds means if you bet a dollar, you will either lose the dollar, or you will win ten dollars (and will also get your original dollar back, of course!)). Problem 4 A transmitter can send one of three signals, s 1,s 2,s 3. The actual transmission is corrupted by noise, causing the received signal to be changed according to the following table of conditional probabilities. Send i Receive j s 1 s 2 s 3 s 1.8.1.1 s 2.05.9.05 s 3.02.08.9 In this table, the entry of rowiand columnj corresponds to the conditional probabilityp(s j is received s i is sent ). Assume that the three signals are transmitted with equal probability. a) Compute the probabilities that s 1,s 2,s 3 are received. b) Compute the conditional probabilities P(s i is sent s j is received ) for i,j 1,2,3. Problem 5 If H 0 is the true hypothesis, the random variable X takes on values 0, 1, 2, and 3 with probabilities 0.1, 0.2, 0.3, and 0.4 respectively. If H 1 is the true hypothesis, the random variable X takes on values 0, 1, 2, and 3 with probabilities 0.4, 0.3, 0.2, and 0.1 respectively. a) Write down the likelihood matrix L and indicate the maximum-likelihood decision rule by shading the appropriate entries in L. What is the false-alarm probability P FA and what is the missed-detection probability P MD for the maximum-likelihood decision rule? 2

b) Suppose that the hypotheses have a priori probabilities π 0 0.7 and π 1 0.3. Use the law of total probability to find the average error probability of the maximum-likelihood decision rule that you found in part (a). c) Use the a priori probabilities given in part (b) to find the joint probability matrix J and indicate on it the Bayesian decision rule, which is also known as the maximum a posteriori probability (MAP) decision rule. What is the average error probability of the Bayesian decision rule? Is it smaller or larger than the average error probability of the maximum- likelihood decision rule? a) k 0 1 2 3 P (X k H 1 ).4.3.2.1 P (X k H 0 ).1.2.3.4 Let E denote the event that the decisions is wrong. For P FA, look at the row corresponding to P ( H 0 ). We have P FA P (E H 0 ).1+.2.3. For P M, look at the row corresponding to P ( H 1 ). We have P M P (E H 1 ).1+.2.3. b) We have P (E) P (H 0 )P (E H 0 )+P (H 1 )P (E H 1 ) π 0 P FA +π 1 P M 0.3. c) k 0 1 2 3 P (X k,h 1 ) π 1 P (X k H 1 ).12.09.06.03 P (X k,h 0 ) π 0 P (X k H 0 ).07.14.21.28 P FA.1, P M.1+.2+.3.6, P (E) sum of the entries that are not underlined.07+.09+.06+.03.25. Probability of error for MAP is smaller and that is exactly what we would expect. Problem 6 A transmitter chooses one of two routes (Route 0 or Route 1) and repeatedly transmits a packet over the chosen route until the packet is received without error (that is, without CRC checksum failure) at the receiver. Suppose an error-free feedback link allows the transmitter to know when the packet is transmitted without error. Let X denote the number of times the packet is transmitted over the chosen route including the final error-free transmission. Assuming that the successive transmissions are independent trials of an experiment, the two hypotheses are H 1 : Route 1 is used for packet transmission: X Geo(p 1 ) 3

H 0 : Route 0 is used for packet transmission: X Geo(p 0 ) where 0 < p 1 < p 0 < 1 are the probabilities of error-free transmission over the two routes. a) State the maximum-likelihood decision rule as to which route was used as a threshold test on the observed value of X. b) Suppose the transmitter chooses Route 0 and Route 1 with probabilities π 0 and π 1 1 π 0 respectively. Assume that 0 < π 0 < 1. For what values of π 0 (if any) does the MAP decision rule always choose hypothesis H 1 regardless of the value of the observation X? For what values of π 0 (if any) does the MAP decision rule always choose hypothesis H 0 regardless of the value of the observation X? a) First, find the likelihood ratio: Λ(k) P (X k H 1) P (X k H 0 ) p 1(1 p 1 ) k 1 p 0 ( ) k 1. Suppose that ties are broken in favor of H 0. The ML rule is decide H 1 Λ(k) > 1 logλ(k) > 0 ( ) ( ) p1 log +(k 1)log > 0 p 0 ( ) ( ) p0 (k 1)log > log p 1 ( ) k 1 > log(p 0/p 1 ) ) log( k > log(p 0/p 1 ) log( ) +1, where ( ) follows since 0 < p 1 < p 0 < 1 and thus log( ) > 0. 4

b) Define τ π0 π 1. Similar to the previous part, we have decide H 1 Λ(k) > τ ( ) logλ(k) > logτ ( ) ( ) p1 log +(k 1)log > logτ p 0 ( ) ( ) τp0 (k 1)log > log p 1 k 1 > log(τp 0/p 1 ) ) k > log(τp 0/p 1 ) log( ) +1, (1) where ( ) follows from the fact that τ > 0 and its logarithm is defined. If log(τp0/p1) ) +1 < 1, we always decide in favor of H 1. Thus we must have ( ) τp0 log p 1 < 0 τp 0 p 1 < 1 π 0 1 π 0 < p 1 p 0 π 0 < p 1/p 0 1+p 1 /p 0 π 0 < p 1 p 0 +p 1 On the other hand, we choose H 0 if k log(τp 0/p 1 ) ) +1, k. It is clear that this condition cannot be satisfied since no matter what the right-hand side is, there exists a k larger than the value of the right-hand side. Problem 7 The probability that a light bulb manufactured by Transylvania Corp. burns out during the nth hour of operation is p 1 (n),n 1,2,. The probability that a light bulb manufactured by Eastinghouse Corp. burns out during the nth hour of operation is p 2 (n),n 1,2,. A bulb is equally likely to have been made by one of the two manufacturers. a) What is the probability that the bulb burns out during the Mth hour of operation? b) Given that the bulb burned out during the Mth hour of operation, what is the probability that it was manufactured by Transylvania Corp.? c) Given that the bulb is still burning at the end of the Mth hour of operation, what is the probability that it was manufactured by Transylvania Corp.? Let BM denote the bulb manufacturer and, A : bulb burns out during Mth hour T : Bulb manufacturer is Transylvania Corp. E : Bulb manufacturer is Eastinghouse Corp. 5

a) Since the blubs are equally likely to be manufacutered by Transylvania Corp and Eastinghouse Corp., P(T) P(E) 1 2. Hence, the probability that the bulb burns out during Mth hour is P (A) 1 (P (A T)+P (A E)) 2 1 2 (p 1(M)+p 2 (M)) b) Given that the bulb burned out during the Mth hour of operation, the probability that it was manufactured by Transylvania Corp. is P(T A) P(AT) P(A) P(A T)P(T) P(A) p 1 (M) p 1 (M)+p 2 (M) c) Let C denote the event that the Bulb is still buring at the end of Mth hour. Then, P(C T) P(Bulb is still buring at end of M-th hour T) p 1 (i) im+1 P(C E) P(Bulb is still buring at end of M-th hour E) p 2 (i) im+1 Hence, the probability that the bulb was manufactured by Transylvania Corp. given that it is still burning at the end of the M-th hour of operation is P(T C) P(C T)P(T) P(C) im+1 p 1(i) 1 2 im+1 p 1(i) 1 2 + im+1 p 2(i) 1 2 {im+1} p 1(i) im+1 p 1(i)+p 2 (i) Problem 8 Alice and Bob play the following game. First, Alice rolls a fair die and then Bob rolls the fair die. If Bob rolls a number at least as large as Alice s number, he wins the game. But if Bob rolled a number smaller than Alice s number, then Alice rolls the die again. If her second roll gives her a number that is less than or equal to Bob s number, the game ends with no winner (a tie, or draw as the British call it). If her second roll gives a number larger than Bob s number, Alice wins the game. Find the probability that Alice wins the game and the probability that Bob wins the game. Also, find the probability of a tie directly (and not as P(tie) 1-P(Alice wins)-p(bob wins).) If the three probabilities do not add up to 1, explain. Let A denote the number Alice rolls, B denote the number Bob rolls, and C denote the number Alice rolls in case Bob does not win in the first round. Hence, 6

Bob wins if B A. Alice wins if B < A and B < C. It s a tie if B < A and B C. Probability that Alice wins is P(B A) P(B a)p(a a) a1 P(B a) 1 6 a1 ( ) 7 a 1 6 6 a1 21 36 7 12 P(B < A&B < C) Probability that there will be a tie is P(B < A&B C) Hence, the three probabilities sum up to 1. a1 c1 a1 c1 a1 c1 P(B < a&b < c)p(a a,c c) P(B < min(a,c)) 1 6 2 min(a,c) 1 6 1 6 2 11 0 6 3 + 9 1 6 3 + 7 2 6 3 + 5 3 6 3 + 3 4 6 3 + 1 5 6 3 55 216 a1 c1 a1 c1 a1 c1 P(B < a&b c)p(a a,c c) P(B [c,a)&c < a) 1 6 2 ( a c 6 ) + 1 6 2 5 1 6 3 + 4 2 6 3 + 3 3 6 3 + 2 4 6 3 + 1 5 6 3 35 216 P(Bob wins)+p(alice wins) +P(tie) 21 36 + 55 216 + 35 216 1 The three probabilties should sum up to 1 because at the end of the match, these are the three possible results. 7