prob09 lecture3 revised
TRANSCRIPT
-
7/31/2019 Prob09 Lecture3 Revised
1/68
Lecture 3
Conditional Probability, Independence
and Sequential Experiments
Last Time
Probability Axioms
Some Consequences of the Axioms
Conditional Probability
Reading Assignment: Sections 1.1-1.5
Probability & Stochastic Processes
Yates & Goodman (2nd Edition) NTUEE SCC_03_20083- 1
-
7/31/2019 Prob09 Lecture3 Revised
2/68
Lecture 3: Probabilities and Experiments
This Week
Independence
Sequential Experiments &Tree Diagrams
Counting Methods
Independent Trials
Reliabilit Methods
Discrete Random Variables
Definitions
Probability Mass Function
Reading Assignment: Sections 1.6-2.2
Probability & Stochastic Processes
Yates & Goodman (2nd Edition) NTUEE SCC_03_20083- 2
-
7/31/2019 Prob09 Lecture3 Revised
3/68
Lecture 3:
Next Week
Discrete Random Variables
Probability Mass Function
Family of D.R.Vs
Cumulative Distribution Function
Averages
Reading Assignment: Sections 2.1-2.5
Probability & Stochastic Processes
Yates & Goodman (2nd Edition) NTUEE SCC_03_20083- 3
-
7/31/2019 Prob09 Lecture3 Revised
4/68
Diaconis, P., Holmes, S., and Montgomery, R. (2007)
Dynamical Bias in the Coin Toss. SIAM Review 49, 211-235.
Persi Diaconis (Jan. 31, 1945 - , )
Sunseri Prof. of Statistics and Mathematics, Stanford U.
born into a family of professional musicians
left home at 14 to travel with magician Dai Vernon
at 16 on his own as a magician for 8 years
a friend recommended a probability book by Feller and then found that he couldn't read it
so enrolled in N.Y. City College at night and got degree in mathematics in 2.5 years
got PhD in statistics, Harvard, in 3 years Stanford
an expert at deception
"I work from seven A.M. to midnight each day. I'm always doing mathematics."
-
7/31/2019 Prob09 Lecture3 Revised
5/68
0
sender receiver
0p
12 - 5
11
q
-
7/31/2019 Prob09 Lecture3 Revised
6/68
Conditional Probability (Graphic Interpretation)
S
A B1
Probability & Stochastic Processes
Yates & Goodman (2nd Edition) NTUEE SCC_03_20083- 6
B2
P(A|B1) = ?
P(B1|A) = ?
-
7/31/2019 Prob09 Lecture3 Revised
7/68
Semiconductor Process Control
16 - 7
-
7/31/2019 Prob09 Lecture3 Revised
8/68
-
7/31/2019 Prob09 Lecture3 Revised
9/68
-
7/31/2019 Prob09 Lecture3 Revised
10/68
-
7/31/2019 Prob09 Lecture3 Revised
11/68
-
7/31/2019 Prob09 Lecture3 Revised
12/68
-
7/31/2019 Prob09 Lecture3 Revised
13/68
-
7/31/2019 Prob09 Lecture3 Revised
14/68
-
7/31/2019 Prob09 Lecture3 Revised
15/68
Example 1.23 again,Q: E1 = {1,2}, E2={2,3}, E3={1,3},
E1 & E3, E2&E3, E1 &E2 independent?How about E1&E2&E3?
-
7/31/2019 Prob09 Lecture3 Revised
16/68
-
7/31/2019 Prob09 Lecture3 Revised
17/68
-
7/31/2019 Prob09 Lecture3 Revised
18/68
-
7/31/2019 Prob09 Lecture3 Revised
19/68
-
7/31/2019 Prob09 Lecture3 Revised
20/68
-
7/31/2019 Prob09 Lecture3 Revised
21/68
-
7/31/2019 Prob09 Lecture3 Revised
22/68
-
7/31/2019 Prob09 Lecture3 Revised
23/68
-
7/31/2019 Prob09 Lecture3 Revised
24/68
-
7/31/2019 Prob09 Lecture3 Revised
25/68
-
7/31/2019 Prob09 Lecture3 Revised
26/68
Q: 20!=
=2.43x 1910
-
7/31/2019 Prob09 Lecture3 Revised
27/68
-
7/31/2019 Prob09 Lecture3 Revised
28/68
-
7/31/2019 Prob09 Lecture3 Revised
29/68
-
7/31/2019 Prob09 Lecture3 Revised
30/68
-
7/31/2019 Prob09 Lecture3 Revised
31/68
-
7/31/2019 Prob09 Lecture3 Revised
32/68
-
7/31/2019 Prob09 Lecture3 Revised
33/68
-
7/31/2019 Prob09 Lecture3 Revised
34/68
-
7/31/2019 Prob09 Lecture3 Revised
35/68
-
7/31/2019 Prob09 Lecture3 Revised
36/68
-
7/31/2019 Prob09 Lecture3 Revised
37/68
-
7/31/2019 Prob09 Lecture3 Revised
38/68
-
7/31/2019 Prob09 Lecture3 Revised
39/68
-
7/31/2019 Prob09 Lecture3 Revised
40/68
-
7/31/2019 Prob09 Lecture3 Revised
41/68
-
7/31/2019 Prob09 Lecture3 Revised
42/68
-
7/31/2019 Prob09 Lecture3 Revised
43/68
-
7/31/2019 Prob09 Lecture3 Revised
44/68
-
7/31/2019 Prob09 Lecture3 Revised
45/68
-
7/31/2019 Prob09 Lecture3 Revised
46/68
-
7/31/2019 Prob09 Lecture3 Revised
47/68
-
7/31/2019 Prob09 Lecture3 Revised
48/68
-
7/31/2019 Prob09 Lecture3 Revised
49/68
-
7/31/2019 Prob09 Lecture3 Revised
50/68
-
7/31/2019 Prob09 Lecture3 Revised
51/68
-
7/31/2019 Prob09 Lecture3 Revised
52/68
-
7/31/2019 Prob09 Lecture3 Revised
53/68
-
7/31/2019 Prob09 Lecture3 Revised
54/68
-
7/31/2019 Prob09 Lecture3 Revised
55/68
VLSI Testing example
A semiconductor wafer has M VLSI chips on it and these chipshave the same circuitry. Each VLSI chip consists ofN
interconnected transistors. A transistor may fail (not function
properly) with a probability p because of its fabrication process,
which we assume to be independent among individual
Semiconductor Yield Analysis
transistors. A chip is considered a failure if there are n or moretransistor failures.
Derive the probability that a chip is good.
Probability & Stochastic Processes
Yates & Goodman (2nd Edition) NTUEE SCC_03_20083- 55
-
7/31/2019 Prob09 Lecture3 Revised
56/68
Semiconductor Yield Analysis: Root Cause Diagnosis
Now suppose that the value of a current Iof the chip depends ontransistor 1. If transistor 1 fails, we will observe an abnormal I
value with a probability q and a normal Ivalue with a
probability 1-q; if transistor 1 is good, we will observe an
normal Ivalue with a probability rand an abnormal Ivalue with
a probability 1-r. What is the probability that you measure anabnormal Ivalue? When the Ivalue you measured is normal,
what is the probability that transistor 1 actually fails?
Probability & Stochastic Processes
Yates & Goodman (2nd Edition) NTUEE SCC_03_20083- 56
-
7/31/2019 Prob09 Lecture3 Revised
57/68
Independent Trials
Gamblers Ruin Problem
Two gamblers A and B with a and b dollars play the game of faircoin toss with wager of $1 per game until one of them runs out
of money. What is the probability that A runs out of money?
Ans: b/(a+b), why?
Probability & Stochastic Processes
Yates & Goodman (2nd Edition) NTUEE SCC_03_2008
Let p(i) be the probability that a gambler starts with i dollars and run out of money eventually.After a coin toss, the gambler either wins or loses and starts from i+1 or i-1 dollars, so
p(i )= (1/2) p(i+1) + (1/2) p(i-1) .Also, p(0) = 1, p(a+b)= 0, so
p(i+1 )- p(i ) = p(i) p(i-1)Finally, we have
p(i)= (a+b-i)/(a+b),p(a) = b/(a+b).
For an unfair coin toss game, we can also find the probability that gambler A runs out of money
3- 57
-
7/31/2019 Prob09 Lecture3 Revised
58/68
Jailers Paradox: to tell or not to tell
Example Alex, Ben, and Tim are three prisoners, one of
whom is scheduled to die. Alex asks a jailer to tell him whowill be freed so that Alex could ask him to bring a letter to
Alexs wife. If the jailer tells Alex that which one of Ben and
Tim is going to be freed, will this change the probability of
Alex dying?
Probability & Stochastic Processes
Yates & Goodman (2nd Edition) NTUEE SCC_03_20083- 58
Let A, B, T, and J be the event that Alex, Ben, and Tim willdie and the event that a jailer told Alex that Tim will be freed.
Then
P(A|J) = P(J|A)P(A)/[P(J|A)P(A) + P(J|B)P(B) + P(J|T)P(T)]
= (1/2)(1/3)/[(1/2)(1/3) + 1(1/3) + 0(1/3)]
= 1/3.
Q: Relation to independence?
-
7/31/2019 Prob09 Lecture3 Revised
59/68
3- 59
-
7/31/2019 Prob09 Lecture3 Revised
60/68
3- 60
-
7/31/2019 Prob09 Lecture3 Revised
61/68
3- 61
-
7/31/2019 Prob09 Lecture3 Revised
62/68
3- 62
-
7/31/2019 Prob09 Lecture3 Revised
63/68
3- 63
-
7/31/2019 Prob09 Lecture3 Revised
64/68
3- 64
-
7/31/2019 Prob09 Lecture3 Revised
65/68
3- 65
-
7/31/2019 Prob09 Lecture3 Revised
66/68
Code Pattern Detection Example
One bit arrives in each clock0 with prob. P 1 with Prob. 1-p
Prob.{001 is not detected in n clocks} = ?
12 - 66
-
7/31/2019 Prob09 Lecture3 Revised
67/68
Chapter 2 Discrete RandomVariables
-
7/31/2019 Prob09 Lecture3 Revised
68/68
Example 2.A1
(1) Toss a coin
(2) Gender at birth
(3) Random walk
Q: Probability space of each experiment?
Probability & Stochastic Processes