Conditional Probability in ELEC 303: Understanding Probabilities with New Information - Pr, Study notes of Electrical and Electronics Engineering

A set of lecture notes from rice university's elec 303 course, taught by farinaz koushanfar in fall'08. The notes cover the topic of conditional probability, including definitions, examples, and applications. Students will learn about the multiplication rule, total probability theorem, and bayes rule, as well as how to calculate conditional probabilities using these theorems.

Typology: Study notes

Pre 2010

Uploaded on 08/19/2009

koofers-user-wlg-2
koofers-user-wlg-2 🇺🇸

10 documents

1 / 11

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
8/25/2008
1
ELEC 303, Koushanfar, Fall’08
ELEC 303 – Random Signals
Lecture 2 – Conditional probability
Farinaz Koushanfar
ECE Dept., Rice University
Aug 28, 2008
ELEC 303, Koushanfar, Fall’08
Lecture outline
Reading: Sections 1.3, 1.4
Review
Conditional probability
Multiplication rule
Total probability theorem
Bayes rule
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download Conditional Probability in ELEC 303: Understanding Probabilities with New Information - Pr and more Study notes Electrical and Electronics Engineering in PDF only on Docsity!

ELEC 303, Koushanfar, Fall’

ELEC 303 – Random Signals

Lecture 2 – Conditional probability

Farinaz Koushanfar ECE Dept., Rice University Aug 28, 2008

ELEC 303, Koushanfar, Fall’

Lecture outline

  • Reading: Sections 1.3, 1.
  • Review
  • Conditional probability
    • Multiplication rule
    • Total probability theorem
    • Bayes rule

ELEC 303, Koushanfar, Fall’

Probability theory -- review

  • Mathematically characterizes random events
  • Defined a sample space of possible outcomes
  • Probability axioms:
    1. ( Nonnegativity ) 0≤P(A)≤1 for every event A
    2. ( Additivity ) If A and B are two disjoint events, then the probability P(A∪B)=P(A)+P(B)
    3. ( Normalization ) The probability of the entire sample space Ω is equal to 1, i.e., P(Ω)= Ω A (^) B

ELEC 303, Koushanfar, Fall’

Discrete/continuous models -- review

  • Discrete: finite number of possible outcomes
    • Enumerate the possible scenarios and count
  • Continuous: the sample space is continuous
    • The probability of a point event is zero
    • Probability=area in the sample space

ELEC 303, Koushanfar, Fall’

Conditional probability

  • Definition: Assuming P(B)≠0, then

P(A|B) = P(A∩B) / P(B)

  • Consequences: If P(A)≠0 and P(B)≠0, then

P(A∩B) = P(B).P(A|B) = P(A).P(B|A)

Ω A B

ELEC 303, Koushanfar, Fall’

Conditional probability example 2

  1. What is the probability of both dices showing odd numbers given that their sum is 6? {1,5},{5,1},{2,4},{4,2},{3,3} {1,5},{5,1},{3,3}
  2. Let B is the event: min (X,Y)=3, Let M = max{X,Y}. What are the probabilities for M over all of its possible values?

ELEC 303, Koushanfar, Fall’

Conditional probability example 3

  • Radar detection vs. airplane presence
  • What is the probability of having an airplane?
  • What is the probability of airplane being there if the radar reads low?
  • When should we decide there is an airplane and when should be decide there is none?

Slide courtesy of Prof. Dahleh, MIT

ELEC 303, Koushanfar, Fall’

Sequential description

  • (A): aircraft present, (Ac): aircraft absent
  • (L): low, (M): medium, (H): high

P(A)=0.

P(Ac)=0.

Multiplication rule: Assuming that all of the conditioning events have positive probability,

... ( | )

( ) ( ) ( | ) ( | )... (^11)

1 1 2 1 3 1 2 n ni i

ni i PA A

P A PA PA A PA A A =^ −

= = ∩ I

I

ELEC 303, Koushanfar, Fall’

Total probability theorem

  • Divide and conquer
  • Partition the sample space into A 1 , A 2 , A 3
  • For any even B:

P(B) = P(A 1 ∩B) + P(A 2 ∩B) + P(A 3 ∩B) = P(A 1 )P(B|A 1 )+P(A 2 )P(B|A 2 )+P(A 3 )P(B|A 3 )

A 1 A 2 A 3

B

B

B

Bc

Bc

Bc

A 1 ∩B

A 2 ∩B

A 3 ∩B (^) Figure courtesy of Bertsekas&Tsitsiklis, Introduction to Probability, 2008

ELEC 303, Koushanfar, Fall’

Radar example 3 (cont’d)

  • P(Present) = 0.
  • P(Medium|Present)=0.08/0.
  • P(Present|low)=0.02/0.

Example courtesy of Prof. Dahleh, MIT

ELEC 303, Koushanfar, Fall’

Radar example 3 (cont’d)

  • Given the radar reading, what is the best decision about the plane?
  • Criterion for decision: minimize “probability of error”
  • Decide absent or present for each reading

Example courtesy of Prof. Dahleh, MIT

ELEC 303, Koushanfar, Fall’

Radar example 3 (cont’d)

  • Error={Present and decision is absent} or

{Absent and decision is present}

  • Disjoint events
  • P(error)=0.02+0.08+0.

Example courtesy of Prof. Dahleh, MIT

ELEC 303, Koushanfar, Fall’

Extended radar example

  • Given the radar registered high and a plane was absent, what is the probability that there was a threat?
  • How does the decision region behave as a function of p?

Example courtesy of Prof. Dahleh, MIT

ELEC 303, Koushanfar, Fall’

Extended radar example

Example courtesy of Prof. Dahleh, MIT

ELEC 303, Koushanfar, Fall’

Bayes rule

  • The total probability theorem is used in conjunction with the Bayes rule:

Let A 1 ,A 2 ,…,An be disjoint events that form a partition of the sample space, and assume that P(Ai) > 0, for all i. Then, for any event B such that P(B)>0, we have

( ) ( | ) ... ( ) ( | )

( ) ( | ) ( )

( | ) ( ) ( | ) 1 1 n n

i i i i i P A P B A P A PB A

P A P B A P B

P A B P A P B A

= =