



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A lecture note from a probability theory course, specifically from lecture 3, covering topics such as calculating probabilities of events, counting arrangements, and conditional probability. It includes examples and solutions for finding probabilities of having at least two students with the same birthday, sampling with and without replacement, and the probability of an event given another event. It also introduces bayes' rule and the concept of independent and mutually independent events.
Typology: Study notes
1 / 7
This page cannot be seen from the preview
Don't miss anything!




Lecture 3 on BST 631: Statistical Theory I – Kui Zhang, 08/29/
1
Review for the previous lecture Theorem:
How to calculate probabilities of events (1.2.8, 1.2.9, 1.2.11)
Definition:
! n ,^
n r
Theorem:
How to count.
Number of possible arrangements of size
r
from
n
subjects
Without Replacement
(^ r
n ≤^
With Replacement
Ordered
n n
r −
rn
Unordered
n r
n^
r r +^
Example
: Enumerating Outcomes
Chapter 1 – Probability Theory
1.2.4 Enumerating Outcomes
Lecture 3 on BST 631: Statistical Theory I – Kui Zhang, 08/29/
2
Example:
Suppose there are
n n
students in our class, then what is the probability that at least two students
have the same birthday (ignoring the year of their birth and considering there are only 365 days in a year). Solution:
n
n
^ n
Define the event
={at least two students have the same birthday}
then
cA^ ={All students have different birthdays}
n
cA =
! n n ^
Table:
n^
Example 1.2.19 (Sampling with replacement):
Consider sampling
r^ =
items from
n^
objects, with
replacement. The outcomes in the ordered and unordered sample spaces are these:
Unordered
Ordered
Probability
Lecture 3 on BST 631: Statistical Theory I – Kui Zhang, 08/29/
4
Solution 1 (Counting Rules):
(unordered space).
Solution 2 (Conditioning): 4 / 52
Definition 1.3.2:
If
and
are events in
, and
, then the
conditional probability
of
given
written as
is
. Specifically, if
and
are disjoint, then
Example 1.3.3:
(4 aces in four cards|
i^ aces in
i^
cards)=
(4 aces in four cards)/
( i
aces in
i^
cards), which
equals to
i^
i ^
Remark:
We require
for the calculation. We will defer the discussion of this until Chapter 4.
For
, you can verify that the function
satisfies Kolmogarov’s Axioms. It can be considered
as a probability function defined on
The calculation of the conditional probability can be very tricky.
Lecture 3 on BST 631: Statistical Theory I – Kui Zhang, 08/29/
5
Example 1.3.4:
Three prisoners. Three prisoners A, B, and C are on death row. One of them will be randomly
selected and pardoned. One day A asks the warden which of B or C will be executed. The warden says B will beexecuted. What is the probability of A is pardoned when he knows this. Solution:
Define the following events:
={A is pardoned},
={B is pardoned},
={C is pardoned},
={Warden says B will be executed when A asks
him if B or C will be executed}, then
. Because
(A is pardoned
and Warden says B will be executed when A asks him if B or C will be executed)+
(B is pardoned and Warden
says B will be executed when A asks him if B or C will be executed)+
(C is pardoned and Warden says B will be
executed when A asks him if B or C will be executed)= 1/ 6
. Actually,
Also we have
, therefore we have
But the conditional probability of
c
P A B
is the probability of A is pardoned when B is executed.
In both situations, A knows that B will be executed. You may be wondering what is the difference between
and
cB. The difference is that A only asks the status of B and C. If A asks the warden who will be executed (including A himself) and the warden says B will be executed. Then the conditional probability of A is pardoned is 1/ 2 .Please verify this by yourself. Remark: 1.
1
1
i^
i^
i
i^
i
∞^
∞
=^
=
Lecture 3 on BST 631: Statistical Theory I – Kui Zhang, 08/29/
7
1
1 (^
j^
j
k^
k
i^
i
j
j P^
=
=
Remark:
If a collection of events
1
2 ,^
are mutually independent, then all the pairs of them are independent.
However, even all of pairs are independent; they may not be mutually independent. Example:
If a collection of events
1
2 ,^
are mutually independent,
) i
i
p =^
i^
n
=^
), then calculate the
probability of the following events:(1)
n^^1
c i i
B^
= =^
(none of
A^ occurs): i
1
n
i
i
p
=
=^
n^1
i i
C^
= =^
(at least of
A^ occurs): i
1
n
i
i
p
=
n^
c
i^
j
i^
j^ i
=^
≠
(exactly one
A^ occurs): i
1
n
i^
j
i^
j^ i
p^
p
=^
Example:
A large machine consists of 50 components. Past experience has shown that a particular component has
a probability of 0.1% to fail. Suppose that the performance of one component will not affect another. Theequipment will work if no more than one component fails. What is the probability that the machine will work? Solution:
Define
A^ = i
{the
i^
th component}, then
i P A
and
A ii
are mutually independent.
Define
={the equipment will work} ={exactly one component fails }
{none of component fails}, therefore,
50
49
We can get
and
if^
i P A
and
i P A
, respectively.