Chapter 4 - Introduction to Probability p.173 Flashcards

1
Q

Addition law p.191

A

A probability law used to compute the probability of the union of two events. It is
Probability(Union(A,B)) = Probability(A) + Probability(B) - Probability(Intersect(A,B))

For mutually exclusive events, Probability(Intersect(A,B)) = 0; in this case the addition law reduces to Probability(Union(A,B)) = Probability(A) + Probability(B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Basic requirements for assigning probabilities p.180

A

§ Two requirements that restrict the manner in which the probability assignments can be made:

    1. For each experimental outcome E we must have 0 <= P€ <= 1;
    2. Considering all experimental outcomes, we must have P(E1) + P(E2) + . . . + P(En) = 1.0
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Bayes’ theorem p.204

A

A method used to compute posterior probabilities.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Classical method p.180

A

A method of assigning probabilities that is appropriate when all the experimental outcomes are equally likely.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Combination p.179

A

In an experiment we may be interest in determining the number of ways n objects may be selected from among N objects without regard to the order in which the n objects are selected. Each selection of n objects is called a combination and the total number of combinations of N objects taken n at a time is

Combination(N,n) = (N . n) = N!/(n!(N - n)!) for n = 0,1,2,…,N.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Complement of A p.189

A

The event consisting of all sample points that are not in A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Conditional probability p.196

A

The probability of an event given that another event already occurred. The conditional probability of a given B is
P(A | B) = P(Intersect(A,B))/P(B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Event

A

A collection of sample points.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Experiment

A

A process that generates well-defined outcomes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Independent events p.199

A

Two events A and B where P(A|B) = P(A) or P(B|A) = P(B); that is, the events have no influence on each other.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Intersection of A and B p.191

A

The event containing the sample points belonging to both A and B.
The intersection is denoted Intersect(A,B)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Joint probability p.197

A

The probability of two events both occurring; that is, the probability of the intersection of two events.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Marginal probability p.197

A

The values in the margins of a joint probability table that provide the probabilities of each event separately.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Multiple-step experiment p.176

A

An experiment that can be described as a sequence of steps. If a multiple-step experiment has k steps with n1 possible outcomes on the first step, n2 possible outcomes on the second step, and so on, the total number of experiment outcomes is given by (n1)(n2)…(nk)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Multiplication law p.199

A

A probability law used to compute the probability of the intersection of two events. It is
P(Intersect(A,B)) = P(B)P(A|B), or
P(Intersect(A,B)) = P(A)P(B|A).

For independent events it reduces to
P(Intersect(A,B)) = 0.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Mutually exclusive events p.193

A

Events that have no sample points in common; that is, Intersect(A,B) is empty and Probability(Intersect(A,B)) = 0.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Permutation p.179

A

In an experiment we may be interested in determining the number of ways n objects may be selected from among N objects when the order in which the n objects are selected is important. Each ordering of n objects is called a permutation and the total number of permutations of N objects taken n at a time is

Permutations(N,n) = n!(N . n) = N!/(N - n)! For n = 0, 1, 2, …, N.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Posterior probabilities p.205

A

Revised probabilities of events based on additional information.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Prior probabilities p.204

A

Initial estimates of the probabilities of events.

20
Q

Probability p174

A

A numerical measure of the likelihood that an event will occur.

21
Q

Relative frequency method p.181

A

A method of assigning probabilities that is appropriate when data are available to estimate the proportion of the time the experimental outcome will occur if the experiment is repeated a large number of times.

22
Q

Sample point p.176

A

An element of the sample space. A sample point represents an experimental outcome.

23
Q

Sample space p.176

A

The set of all experimental outcomes.

S = {Head, Tail}

24
Q

Subjective method p.181

A

A method of assigning probabilities on the basis of judgement.

25
Q

Tree diagram p.177

A

A graphical representation that helps in visualizing a multiple-step experiment.

26
Q

Union of A and B p.190

A

The event containing all samples points belonging to A or B or both.

The union is denoted: Union(A,B)

27
Q

Venn diagram p.189

A

A graphical representation for showing symbolically the sample space and operations involving events in which the sample space is represented by a rectangle and events are represented as circles within the sample space.

28
Q

4.1 Counting Rule for Combinations

A

The number of combinations of N objects taken n at a time is
Combination(N,n) =(N . n) = N!/(n!(N - n)!)
Where
N! = N(N - 1)(N - 2) . . . (2)(1)
n! = n(n- 1)(n - 2) . . . (2)(1)
And, by definition,
0! = 1

29
Q

4.2 Counting Rule for Permutations

A

The number of permutations of N objects taken nat a time is given by

PNn = n!(N . n) = N!/(N - n)! , For n = 0, 1, 2, …, N.

30
Q

4.5 Computing Probability Using the Complement

A

Probability(A) = 1 - Probability(Complement(A))

31
Q

4.6 Addition Law

A

Probability(Union(A,B)) = Probability(A) + Probability(B) - Probability(Intersect(A,B))

32
Q

4.7 Conditional Probability

A
P(A|B) = P(Intersect(A,B))/P(B)
P(B|A) = P(Intersect(A,B))/P(A)
33
Q

4.11 Multiplication Law

A
P(Intersect(A,B)) = P(B)P(A|B)
P(Intersect(A,B)) = P(A)P(B|A)
34
Q

4.13 Multiplication Law for Independent Events

A

P(Intersect(A,B)) = P(A)P(B)

35
Q

4.19 Bayes’ Theorem

A

P(Ai|B) = P(Ai)P(B|Ai) / [P(A1)P(B|A1) + P(A2)P(B|A2) + . . . P(An)P(B|An)]

36
Q

Random experiment

A

A random experiment is a process that generates well-defined experimental outcomes. On any single repetition or trial, the outcome that occurs is determined completely by chance.
n! = n(n- 1)(n - 2) . . . (2)(1)
1. The experimental outcomes are well defined, and in many cases can even be listed prior to conducting the experiment.
2. On any single repetition or trial of the experiment, one and only one of the possible experimental outcomes will occur.
3. The experimental outcome that occurs on any trial is determined solely by chance.

37
Q

Samples space

A

The sample space for a random experiment is the set of all experimental outcomes.

38
Q

Counting rule for multiple-step experiments

A

If an experiment can be described as a sequence of k steps with n1 possible outcomes on the first step, n2 possible outcomes on the second step, and so on, the total number of experiment outcomes is given by (n1)(n2)…(nk)

39
Q

Basic Requirements for Assigning Probabilities

A
  1. The probability assigned to each experimental outcome must be between 0 and 1, inclusively. If we let Exp(i) denote the ith experimental outcome and Probability(Exp(i)) its probability, then this requirement can be written as
    • 0 <= Probability(Exp(i)) <= 1 for all I
  2. The sum of the probabilities for all the experimental outcomes must equal 1.0. Fr n experimental outcomes, this requirement can be written as
    • Probability(Exp(1)) + Probability(Exp(2)) + . . . + Probability(Exp(n)) = 1
40
Q

Event

A

An event is a collection of sample points.

41
Q

Probability of an event

A

The probability of any event is equal to the sum of the probabilities of the sample points in the event.

The probability of event C is given by:
Probability(c) = P(2, 6) + P(2, 7) + P(2, 8) + P(3, 6) + P(3, 7)

42
Q

Union of two events

A

The union of A and B is the event containing all sample points belonging to A or B or both.

The union is denoted by Union(A,B)

43
Q

Intersection of Two Events

A

Given two events A and B, the intersection of A and B is the event containing the sample points belonging to both A and B.

The intersection is denoted Intersect(A,B)

44
Q

Mutually Exclusive Events

A

Two events are said to be mutually exclusive if the events have no sample points in common.

45
Q

Addition Law for Mutually Exclusive Events

A

P(Union(A,B)) = P(A) + P(B)

46
Q

Independent events

A

Two events A and B are independent if
P(A|B) = P(A), or
P(B|A) = P(B)
Otherwise, the events are dependent.

47
Q

Bayes’ Theorem (Two-Event Case)

A

P(A1|B) = P(A1)P(B|A2) / [P(A1)P(B|A1) + P(A2)P(B|A2)]

P(A2|B) = P(A2)P(B|A2) / [P(A1)P(B|A1) + P(A2)P(B|A2)]