Conditional Probability and Bayes

Similar documents
LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

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

Chapter 2.5 Random Variables and Probability The Modern View (cont.)

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

Lecture 1. ABC of Probability

Lecture 2: Probability, conditional probability, and independence

Axiomatic Foundations of Probability. Definition: Probability Function

Probability- describes the pattern of chance outcomes

ECE 302: Chapter 02 Probability Model

Independence Solutions STAT-UB.0103 Statistics for Business Control and Regression Models

4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio

the time it takes until a radioactive substance undergoes a decay

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

Probability Theory and Applications

Statistical Theory 1

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

MA : Introductory Probability

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics?

Properties of Probability

Econ 325: Introduction to Empirical Economics

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

Elementary Discrete Probability

2. AXIOMATIC PROBABILITY

Announcements. Topics: To Do:

Dynamic Programming Lecture #4

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

Lecture notes for probability. Math 124

Introduction to Probability. Ariel Yadin. Lecture 1. We begin with an example [this is known as Bertrand s paradox]. *** Nov.

1 INFO Sep 05

With Question/Answer Animations. Chapter 7

Introduction to Probability 2017/18 Supplementary Problems

Chapter 3 : Conditional Probability and Independence

Chapter 14. From Randomness to Probability. Copyright 2012, 2008, 2005 Pearson Education, Inc.

Introduction and basic definitions

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability

CMPSCI 240: Reasoning about Uncertainty

18.600: Lecture 7 Bayes formula and independence

Basic Statistics and Probability Chapter 3: Probability

Lecture 16. Lectures 1-15 Review

STA Module 4 Probability Concepts. Rev.F08 1

Chapter 2 Class Notes

2011 Pearson Education, Inc

18.600: Lecture 7 Bayes formula and independence

F71SM STATISTICAL METHODS

Chapter 7 Wednesday, May 26th

HW MATH425/525 Lecture Notes 1

Conditional Probability

Independence. P(A) = P(B) = 3 6 = 1 2, and P(C) = 4 6 = 2 3.

Lecture 7. Bayes formula and independence

Outline Conditional Probability The Law of Total Probability and Bayes Theorem Independent Events. Week 4 Classical Probability, Part II

Statistical Inference

CSC Discrete Math I, Spring Discrete Probability

1 The Basic Counting Principles

Lecture 10: Probability distributions TUESDAY, FEBRUARY 19, 2019

Probability & Random Variables

Presentation on Theo e ry r y o f P r P o r bab a il i i l t i y

Conditional Probability and Bayes Theorem (2.4) Independence (2.5)

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

Notes slides from before lecture. CSE 21, Winter 2017, Section A00. Lecture 16 Notes. Class URL:

Dept. of Linguistics, Indiana University Fall 2015

Introduction to Probability

Probability (Devore Chapter Two)

Lecture 2: Probability

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 3 9/10/2008 CONDITIONING AND INDEPENDENCE

EE 178 Lecture Notes 0 Course Introduction. About EE178. About Probability. Course Goals. Course Topics. Lecture Notes EE 178

Discrete Probability

Notes 1 Autumn Sample space, events. S is the number of elements in the set S.)

Topic 5 Basics of Probability

Lecture Lecture 5

STAT 285 Fall Assignment 1 Solutions

Origins of Probability Theory

Chapter 2: Probability Part 1

Lectures Conditional Probability and Independence

Discrete Random Variables

Determining Probabilities. Product Rule for Ordered Pairs/k-Tuples:

I - Probability. What is Probability? the chance of an event occuring. 1classical probability. 2empirical probability. 3subjective probability

Uncertain Knowledge and Bayes Rule. George Konidaris

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability

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

Probability Review I

CS 361: Probability & Statistics

STAT509: Probability

Lecture 3. January 7, () Lecture 3 January 7, / 35

Probability and Independence Terri Bittner, Ph.D.

Topic -2. Probability. Larson & Farber, Elementary Statistics: Picturing the World, 3e 1

Topic 2 Probability. Basic probability Conditional probability and independence Bayes rule Basic reliability

Example: Suppose we toss a quarter and observe whether it falls heads or tails, recording the result as 1 for heads and 0 for tails.

Deep Learning for Computer Vision

Probability Notes (A) , Fall 2010

1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).

PERMUTATIONS, COMBINATIONS AND DISCRETE PROBABILITY

Recitation 2: Probability

Compound Events. The event E = E c (the complement of E) is the event consisting of those outcomes which are not in E.


Basic Concepts of Probability

P (A) = P (B) = P (C) = P (D) =

STAT Chapter 3: Probability

MATH 3C: MIDTERM 1 REVIEW. 1. Counting

Problems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman.

Chapter Summary. 7.1 Discrete Probability 7.2 Probability Theory 7.3 Bayes Theorem 7.4 Expected value and Variance

Transcription:

Conditional Probability and Bayes Chapter 2 Lecture 5 Yiren Ding Shanghai Qibao Dwight High School March 9, 2016 Yiren Ding Conditional Probability and Bayes 1 / 13

Outline 1 Independent Events Definition 2 Back to Kindergarten Yiren Ding Conditional Probability and Bayes 2 / 13

Independent Events Definition Independent Events Definition 1. Two events A and B are independent if P(AB) = P(A)P(B) Recall from previous lecture P(A B) = P(AB) P(B). Suppose P(A B) = P(A). This means that the occurrence of event A is not contingent on whether B occurs. Warning: Independent events and disjoint events are completely different things! If A and B are disjoint, then P(A B) = P(A) + P(B) by Rule 1. If A and B are independent, then P(AB) = P(A)P(B). Yiren Ding Conditional Probability and Bayes 3 / 13

Independent Events 1. Suppose two fair dice are thrown. Let A be the event that the number shown by the first die is even and B the event that the sum of the dice is odd. Do you think the events A and B are independent? The experiment has 36 possible outcomes (i, j), representing the numbers shown by each die. All possible outcomes are equally like. By counting, P(A) = 18/36, P(B) = 18/36, and P(AB) = 9/36. Since P(AB) = P(A)P(B), events A and B are independent. Remark: In the case that events A, B and C are pairwise independent, it is not necessarily true that P(ABC) = P(A)P(B)P(C). To see that, let C be the event that the number shown by the second die is even. Events A, B and C are pairwise independent (check), but P(ABC)(= 0) is not equal to P(A)P(B)P(C). In general, events A 1,..., A n are said to be independent if P(A i1...a ik ) = P(A i1 ) P(A ik ), for every A i1,.., A ik, 2 k n Yiren Ding Conditional Probability and Bayes 4 / 13

Back to Kindergarten Back to Kindergarten Again Recall in kindergarten, your teacher gave you a fair die to determine how many times you can flip a fair coin. If no heads appears, you will get a cookie. Since the probability of no heads appears in k flips is (1/2) k, kindergarten instincts tell you that P(cookie) is 1 2 1 6 + 1 4 1 6 + 1 8 1 6 + 1 16 1 6 + 1 32 1 6 + 1 64 1 6 = 0.1641. Indeed this is correct and can be formalized into the following theorem, known as the. Yiren Ding Conditional Probability and Bayes 5 / 13

Theorem 1 (). Let A be an event that can only occur if one of mutually exclusive events B 1,..., B n occurs. Then, P(A) = P(A B 1 )P(B 1 ) + P(A B 2 )P(B 2 ) + + P(A B n )P(B n ). Proof. The proof is really simple. The subset A is contained in the union of mutually exclusive sets B 1,..., B n. This implies A = AB 1 AB 2 AB n, The sets AB i are mutually exclusive, so by Rule 1, and Kindergarten Rule, P(A) = P(AB 1 ) + P(AB 2 ) + + P(AB n ) = P(A B 1 )P(B 1 ) + + P(A B n )P(B n ). Yiren Ding Conditional Probability and Bayes 6 / 13

2. The upcoming Tour de France bicycle tournament will take place from July 1 through July 23. One hundred eighty cyclists will participate in the event. What is the probability that two or more participating cyclists will have birthdays on the same day during the tournament? Yiren Ding Conditional Probability and Bayes 7 / 13

2 solution Denote by A the event that two or more participating cyclists will have birthdays on the same day during the tournament. Event A can occur if one of the mutually exclusive events B 2,..., B 180 occurs, where B i denotes the event that exactly i participating cyclists have their birthdays during the tournament. The conditional probability P(A B i ) is exactly like a birthday problem with i persons and only 23 days in a year: { 1 23 22 (23 i+1), 2 i 23 P(A B i ) = 23 i 1, i 24. The probability is 1 when i 24 by the Pigeonhole Principle! Yiren Ding Conditional Probability and Bayes 8 / 13

2 solution (2) Obviously, P(A B 0 ) = P(A B 1 ) = 0, so, ( 180 P(B i ) = i ) ( 23 365 Putting these together, we have 180 P(A) = P(A B i )P(B i ) i=2 23 = 1 P(B 0 ) P(B 1 ) 0.8841 ) i ( 1 23 ) 180 i, 0 i 180. 365 i=2 23 22 (23 i + 1) 23 i P(B i ) Yiren Ding Conditional Probability and Bayes 9 / 13

3. Two candidates A and B remain in the final of a television game show. At this point, each candidate must spin a wheel of fortune. The numbers 1, 2,..., 100 are listed ont he wheel and when the wheel has stopped spinning, a pointer randomly stops on one of the numbers. Each player has a choice of spinning the wheel one or two times, whereby a second spin must immediately follow the first. The goal is to reach a total closest to but not exceeding 100 points. A player whose total exceeds 100 gets a final score of zero. The winner is the player who gets the highest score. Should both players have the same final score, then the player to spin the wheel first is the winner. Player A has to spin first. What is the optimal strategy for player A? Yiren Ding Conditional Probability and Bayes 10 / 13

3 solution The optimal strategy for player B is obvious. (Why?) To find the optimal strategy for player A, we define S a : The event of player A winning if A stops after the first spin giving a score of a points C a : event of player A winning if A continues after the first spin giving a score of a points Notice that S a can only occur if one of the mutually exclusive events B 1, B 2,..., B a occurs, where B b is the event in which player B scores b points in the first spin. (Why not consider b > a?) Suppose that player B scores b (b a) points on the first spin. Player A is the final winner if player B scores in the second spin either at most a b points or more than 100 b points. Yiren Ding Conditional Probability and Bayes 11 / 13

3 solution (2) Since P(B b ) = 1 100, by the law of conditional probability, we find P(S a ) = a P(S a B b )P(B b ) b=1 = 1 100 a b=1 ( a b 100 + b ) = a2 100 100 2 for 1 a 100. Likewise, we condition the event C a on mutually exclusive events A 1, A 2,..., A 100 a, where A k represents the event in which player A scores k points in the second spin. (Why not consider k > 100 a?) Suppose player A scores a points in the first round, and k points in the second round. Then obviously P(C a A k ) = P(S a+k ). Yiren Ding Conditional Probability and Bayes 12 / 13

3 solution (3) Since P(A k ) = 1 100, we have, P(C a ) = 100 a k=1 P(C a A k )P(A k ) = 1 100 a (a + k) 2 100 100 2 for 1 a 100. k=1 Using CAS, we find that P(C a ) > P(S a ) for 1 a 53 and P(S a ) > P(C a ) for 53 < 1 100. Hence player A should stop after the first spin if score is larger than 53, and continue if otherwise. Under this strategy, the probability of A winning is 1 100 53 a=1 P(C a ) + 1 100 100 a=54 P(S a ) = 0.4596. Yiren Ding Conditional Probability and Bayes 13 / 13