My Avatar

LanternD's Castle

PhD Student in ECE @ MSU

STT 861 Theory of Prob and STT I Lecture Note - 2


Some of the basic probability and statistics concepts. joint probabilities, combinatories; conditional probabilities and independence and their examples; Bayes' rule.

Portal to all the other notes

Lecture 02 - Sept 13 2017

Recall: If A & B are 2 disjoint events, then $P[A\cup B]=P[A]+P[B]$, $P[A\cap B]=P[A]\cdot P[B]$.

If $A\cup B \neq \varnothing$, then $P[A\cap B]=P[A]\cdot P[B] - P[A\cap B]$.

General formula (“inclusion-exclusion formula”)

Example 1

Weather data for 2 consecutive days in some month in some location. We aggregate this data and find: ‘R1 is rain on 1st day’, ‘R2 is rain on 2nd day’. $P[R1]=0.6, P[R2]=0.5, P[R1\cap R2^C]=0.2$. Find $P[R1\cap R2]$ and $P[R1\cup R2]$.


$P[(R1\cap R2^C)\cup(R1\cap R2)]=P[R1]$.

$P[R1\cap R2^C]+P[R1\cap R2]=P[R1] \rightarrow P[R1\cap R2]=0.4$

$P[R1\cup R2] = P[R1] + P[R2] - P[R1\cap R2]=0.6+0.5-0.4 = 0.7$

Example to introduce the use of some combinatories

Form a jury with 6 people. We choose from a group with 8 men & 7 women. Find the prob that there are exactly 2 women in the selected jury.

Need an assumption about the relative prob. of people being picked: 6/15. Every one has equal chance of being picked.

P=({# of ways to pick exactly 2 women})/({# of ways to pick 6 out of 15})

$(C_7^2 \times C_8^4)/C_{15}^6 $

(tree idea)

$C_{15}^6 = 5005$

numerator$ = 21 \times 70 = 1470$

$P = 1470/5005=0.2937$

After the break.

Chapter 1.3 Conditional prob. & independence

Definition: A & B are independence events, if $P[A\cap B] = P[A] \times P[B]$.

The definition comes from the definition of conditional prob.

Definition: Let A & B be two events. The conditional prob of B given A denoted by $P[B|A]$, is $P[A \cap B]/P[A]$.

Note: if $P[B|A] = P[B]$ (given information of A does not affect/influence the chance of B), then the definition is proven.

Example 2

$P[disease]= 0.006$. Test: positive vs negative. $P[positive|dissease] = 0.98$ (sensitivity). $P[pos|no disease]=0.01$.

Q1: Find prob P[pos].

$P[pos] = P[pos \cap disease] + P[neg \cap no disease]$

$P[pos|disease] = P[pos \cap disease]/P[disease] $

$P[pos \cap disease] = 0.98\times0.006$

similarly, $P[neg \cap no~disease] = (1- 0.99)\times(1-0.006)$

$P[pos] = 0.98\times0.006 + (1- 0.99)\times(1-0.006) = 1.582\%$

Q2: Find $P[dis|pos]$.

$P[dis|pos] = P[dis \cap pos]/P[pos] = 0.00588/0.01582 = 0.3717$

The law of total probabilities:

Let $A_1, A_2, …, A_n$ be a partition of $\Omega$. ($A_i$ are all mutually incompatible, and $\sum A_i=\Omega$)

then for any $B\in\Omega$, $P[B]=\sum_i P[B|A_i]P[A_i]$.

Try to prove it at home.

Bayes’ rule

denominator: from law of total prob when n=2, $A_1=A,A_2=A^C$

General Bayes’ Rule:

For every fixed $i$:

Role of different pieces of information in the formula:

At home, relate disease example problem to Bayes’ rule.

Disqus Comment 0