Professional Documents
Culture Documents
1 Introduction
2 Random experiments
Equipropability
Combinatorics
5 Conditional probability
Concept and properties
Independence de Events
Bayes Theorem
1
1 Introduction
12 Random
Random experiments
experiments
Equipropability
Combinatorics
5 Conditional probability
Concept and properties
Independence de Events
Bayes Theorem
2
Examples
Example
Example
Events
E random space
Complemetary event of an event A, is the event that
A does not ocurr
A A
E random space
Imposible event, Ø, is the one that never ocurrs
A
B
B B
Diference between A and B, A-B, is the event that consists of all outcomes that
are contained in A but not in B, i.e., A∩B
E random space
Therefore: A
A = E-A B 10
Example
A → Weight ≥ 11gr
B → Weight ≤ 15gr
C → Weight ≤ 5gr
C A
11
Example
A
12
B 11 15
Estadística: Profesora María Durbán
2 Random experiments
Example
C
13
B 15
Estadística: Profesora María Durbán
2 Random experiments
Example
C A
14
∅
Estadística: Profesora María Durbán
2 Random experiments
Example
C
15
Morgan´s Law
There are several properties of the union, intersection and complementary
event that are known under the Morgan’s Law
E random space
A B=A B A
A
B
E random space
A B=A B A B
B
16
1 Introduction
2 Random experiments
23 Probability:definition
Probability:definition and
and properties
properties
Equipropability
Combinatorics
5 Conditional probability
Concept and properties
Independence de Events
Bayes Theorem
17
18
Example
Frecuencia relativa del número de
caras obtenidos en lanzamientos
sucesivos de una moneda
Converge a 1/2
19
A2 A3 5 5
A1 Pr A i = ∑ Pr ( A i )
i=1 i=1
A4 A4
20
A2 A3 5 5
A1 Pr A i = ∑ Pr ( A i )
i=1 i=1
A5 A4
21
These axioms do not asign probabilities to events, but help to compute probabilities:
22
These axioms do not asign probabilities to events, but help to compute probabilities:
1. P(A) = 1 - P(A)
2. P(∅) = 0 ∅ = E → Pr(∅) = 1 − Pr( E ) = 1 − 1 = 0
3. Si A ⊆ B ⇒ P(A) ≤ P(B)
4. P(B-A) = P(B) - P(A ∩ B)
5. P(A ∪ B) = P(A) + P(B) - P(A ∩ B)
23
These axioms do not asign probabilities to events, but help to compute probabilities:
1. P(A) = 1 - P(A)
2. P(∅) = 0
3. Si A ⊆ B ⇒ P(A) ≤ P(B) B = A ∪ (B ∩ A) → Pr(B) = Pr(A)+Pr(B ∩ A)
24
These axioms do not asign probabilities to events, but help to compute probabilities:
1. P(A) = 1 - P(A)
2. P(∅) = 0
3. Si A ⊆ B ⇒ P(A) ≤ P(B)
B = (A ∩ B) ∪ (B ∩ A)
4. P(B-A) = P(B) - P(A ∩ B) Pr(B)= Pr(A ∩ B) + Pr(B ∩ A)
5. P(A ∪ B) = P(A) + P(B) - P(A ∩ B) Pr(B)= Pr(A ∩ B) + Pr(B-A)
25
These axioms do not asign probabilities to events, but help to compute probabilities:
1. P(A) = 1 - P(A)
2. P(∅) = 0
3. Si A ⊆ B ⇒ P(A) ≤ P(B)
4. P(B-A) = P(B) - P(A ∩ B)
5. P(A ∪ B) = P(A) + P(B) - P(A ∩ B)
A ∪ B=(A-B) ∪ (B-A) ∪ (A ∩ B)
Pr(A ∪ B)=Pr(A)-Pr(A ∩ B)+Pr(B)-Pr(A ∩ B)+Pr(A ∩ B) 26
P(A)
+ A
P(B)
_
B
P(A ∩ B)
P(A U B) AoB 27
Duration
Intensity Satisfactory Not Satisfactory
28
Duration
Intensity Satisfactory Not Satisfactory
A → Intensity satisfactory
B → Duration satisfactory Pr(A ∩ B) Pr(A ∩ B)
Pr(A ∩ B) Pr(A ∩ B)
29
Duration
Intensity Satisfactory No Satisfactory
A → Intensity satisfactory
B → Duration satisfactory Pr(A ∩ B) Pr(A ∩ B)
Pr(A ∩ B) Pr(A ∩ B)
¿ Pr(B) ? B = (A ∩ B) ∪ (A ∩ B)
30
Duration
Intensity Satisfactory No Satisfactory
A → Intensity satisfactory
B → Duration satisfactory Pr(A ∩ B) Pr(A ∩ B)
Pr(A ∩ B) Pr(A ∩ B)
Duración
Intensidad Satisfactory No Satisfactory
A → Intensity satisfactory
B → Duration satisfactory Pr(A ∩ B) Pr(A ∩ B)
Pr(A ∩ B) Pr(A ∩ B)
2. What is the probability thata a lamp has sarisfactory intensity or does not
have satisfactory duration?
Pr(A ∪ B)
= Pr(A) + Pr(B) − Pr(A ∩ B) Pr(A ∪ B)= 0.923 + 0.038 − 0.023= 0.938
32
Pr(A) = Pr(A ∩ B) + Pr(A ∩ B) = 0.9 + 0.023 = 0.923 Pr(B) =
1 − Pr(B) =
1 − 0.962 =
0.038
Estadística: Profesora María Durbán
Introduction to probability
1 Introduction
2 Random experiments
Equipropability
Combinatorics
5 Conditional probability
Concept and properties
Independence de Events
Bayes Theorem
33
Equipropability
If an experiment has a finite number of outcomes and they are equally likely to ocurr.
We will compute the probability of an even as follows:
Given an event A that contains f elementary events, its probability will be:
35
Examples
Pr(Picking a heart) = 13 / 52
36
Equipropability
38
39
3 different groups
40
41
Combinatorics
WITHOUT WITH
REPETITIONS REPETITIONS
ORDER MATTERS n!
Vnk = VRnk = n k
VARIATIONS (n − k )!
ORDER DOESN’T n
k n + k − 1
MATTER C =
n
k
CR =
k
n
k
COMBINATIONS
If n= k → Permutations 42
nº of sucesses
Pr( A) = 9!
2
nº of possible outcomes
In how many ways may I
chose 2 PCs? C
= = 36
9
2!7!
44
There are 9 PCs in the set
Estadística: Profesora María Durbán
4 How to estimate probabilities in practice
3
Pr( A) =
36
45
1 Introduction
2 Random experiments
Equipropability
Combinatorics
5 Conditional probability
4 Conditional probability
Concept and properties
Independence de Events
Bayes Theorem
46
2 2 / 9 Pr( A ∩ B)
Pr( A | B)= = =
5 5/9 Pr( B) 47
A A
B
B
A A
B
B
B ⊂ A ⇒ Pr( A | B) = 1
A ∩ B = ∅ ⇒ Pr( A | B) = 0 Important:
Pr( B) > 0
Pr( A ∩ B)
Pr( A | B) =
Pr( B)
⇒ Pr( A | B) ≥ Pr( A ∩ B)
⇓
Pr( A ∩ B ) = Pr( A | B) Pr( B)
= Pr( B | A) Pr( A)
≤ Pr( A)
50
Pr( A | B) = 0.25
Independent Events
Two events A and B are independents if the fact that A occurs does not affect
the probability of B occurring.
Pr( A | B) = Pr( A)
Pr( A ∩ B) Pr( A=
= | B) Pr( B) Pr( A) Pr( B)
Pr( B | A) = Pr( B)
52
Example
An application of the concept of “independence” is the calcultation of Reliability of a
circuit.
The Reliability of a circuit is the probability that the circuit works correctly.
A B
53
Example
An application of the concept of “independence” is the calcultation of Reliability of a
circuit.
The Reliability of a circuit is the probability that the circuit works correctly.
If the probability that a switch is working is 0.99, what is the probability that the current
goes from A to B?
A B
2
Pr(Going from A to
= B) 0.99
= 0.9801
54
Example
Even if the reliability of each switch is high, if there are many switches, the reliability
of the circuit may be low.
In order to increase the reliability we may connect another circuit in parallel:
1
S1
2
Pr(Going from A to=
B) Pr(S1 ∪ S2 )
= 1 − Pr(Not going A a B)
A B
1 − ( Pr(S1 ) Pr(S2 ) )
1 − Pr(S1 ∩ S2 ) =
3 S2 4
Pr(S1 ) =
1 − Pr(S1 ) =
1 − 0.9801 =
0.0199
1 − 0.01992 =
Pr(Going from A to B) = 0.9996
55
Reliability has increased 2%
Estadística: Profesora María Durbán
5 Conditional probability
Bayes Theorem
56
Bayes Theorem
A1 A2
Let’s suppose that an experiments
has two stages: in the first stage, the
possible events are
57
Bayes Theorem
A3 A4
58
Bayes Theorem
B Third Axiom
P(AUB)=P(A)+P(B) if A∩B=Ø
A3 A4
Bayes Theorem
B
Conditional probability
P(A∩B)=P(A|B)P(B)
A3 A4
Pr(A i ∩ B)
B
Pr(B|A i ) Pr(A i )
Pr(A i |B) =
Pr(B)
A3 A4
Pr( A | B) = 0.25
2. If we know that a part doesn’t work properly, what is the probability that
it has surface faults?
Pr(B|A) A|B
0.25
Pr(A)
0.75
0.1 B A|B
Part
0.05
A|B
0.9
B
0.95 A|B 63
A|B
0.25
0.75
0.1 B A|B
Pieza
0.05
A|B
0.9
B
0.95 A|B 64
0.75
0.1 B A|B
Pieza
0.05
A|B
0.9
B
0.95 A|B 65
let us call the door picked by the contestant door a, the door
opened by Monty Hall door b, and the third door c. We will define
the following events:
• A, B, and C are the events that the prize is behind doors a, b, and
c respectively.
• O is the event that Monty Hall opens door b.
The Monty Hall Problem can be restated as follows: Is Pr{A | O} =
Pr{C | O}?. Calculate the probabilities it using Bayes theorem
66