Political Science 209 - Fall 2018 Probability Florian Hollenbach - - PowerPoint PPT Presentation

political science 209 fall 2018
SMART_READER_LITE
LIVE PREVIEW

Political Science 209 - Fall 2018 Probability Florian Hollenbach - - PowerPoint PPT Presentation

Political Science 209 - Fall 2018 Probability Florian Hollenbach 26th October 2018 Why probability? Probability rules our lives It is everywhere! Florian Hollenbach 1 Why probability? Humans are really bad at interpreting


slide-1
SLIDE 1

Political Science 209 - Fall 2018

Probability

Florian Hollenbach 26th October 2018

slide-2
SLIDE 2

Why probability?

  • Probability rules our lives
  • It is everywhere!

Florian Hollenbach 1

slide-3
SLIDE 3

Why probability?

  • Humans are really bad at interpreting probabilities
  • Even worse at calculating (estimating) probabilities

Florian Hollenbach 2

slide-4
SLIDE 4

Why probability?

Florian Hollenbach 3

slide-5
SLIDE 5

Why probability?

  • What are the chances it rains tomorrow?

Florian Hollenbach 4

slide-6
SLIDE 6

Why probability?

  • What are the chances it rains tomorrow?
  • What are the chances you win the lottery?

Florian Hollenbach 4

slide-7
SLIDE 7

Why probability?

  • What are the chances it rains tomorrow?
  • What are the chances you win the lottery?
  • What is the probabilty of getting an A in pols 209?

Florian Hollenbach 4

slide-8
SLIDE 8

Why probability?

  • We use probability to express and calculate uncertainty
  • Preview: later we will use probability to make statements

about the uncertainty in our data analysis

Florian Hollenbach 5

slide-9
SLIDE 9

Two fundamental concepts of probability

  • Frequentist: long-run frequency of events
  • ratio between the number of times the event occurs and the

number of trials

  • example: coin flips

Florian Hollenbach 6

slide-10
SLIDE 10

Two fundamental concepts of probability

  • Frequentist: long-run frequency of events
  • ratio between the number of times the event occurs and the

number of trials

  • example: coin flips
  • Bayesian: belief about the likelihood of event occurrence
  • evidence based belief
  • often more sensible philosophy in political world

Florian Hollenbach 6

slide-11
SLIDE 11

Important Terms

  • 1. Experiment: an action or a set of actions that produce

stochastic events of interest

Florian Hollenbach 7

slide-12
SLIDE 12

Important Terms

  • 1. Experiment: an action or a set of actions that produce

stochastic events of interest

  • 1. sample space: a set of all possible outcomes of the

experiment, typically denoted by Ω

Florian Hollenbach 7

slide-13
SLIDE 13

Important Terms

  • 1. Experiment: an action or a set of actions that produce

stochastic events of interest

  • 1. sample space: a set of all possible outcomes of the

experiment, typically denoted by Ω

  • 1. event: a subset of the sample space

(Imai - QSS)

Florian Hollenbach 7

slide-14
SLIDE 14

Example

What is the experiment, sample space, and one event for coin flips

  • r pulling a single card out of a deck of 52?

Florian Hollenbach 8

slide-15
SLIDE 15

Defining Probability

Probability of event A = P(A) =

number of elements in A number of elements in sample space Florian Hollenbach 9

slide-16
SLIDE 16

Defining Probability

Probability of event A = P(A) =

number of elements in A number of elements in sample space

Probability of Head = P(H) = 1

2 Florian Hollenbach 9

slide-17
SLIDE 17

Example

What is the probability of 3 head in 3 flips? Sample space?

Florian Hollenbach 10

slide-18
SLIDE 18

Example

What is the probability of 3 head in 3 flips? Sample space? Ω = {HHH,HHT,HTH,THH, HTT, THT, TTH, TTT}

Florian Hollenbach 10

slide-19
SLIDE 19

Example

What is the probability of 3 head in 3 flips? Sample space? Ω = {HHH,HHT,HTH,THH, HTT, THT, TTH, TTT} What is the event space we are interested in?

Florian Hollenbach 10

slide-20
SLIDE 20

Example

What is the probability of 3 head in 3 flips? Sample space? Ω = {HHH,HHT,HTH,THH, HTT, THT, TTH, TTT} What is the event space we are interested in? {HHH}

Florian Hollenbach 10

slide-21
SLIDE 21

Example

What is the probability of 3 head in 3 flips?

Florian Hollenbach 11

slide-22
SLIDE 22

Example

What is the probability of 3 head in 3 flips? P(HHH) = 1

8 Florian Hollenbach 11

slide-23
SLIDE 23

Example

What is the probability of 2 head in 3 flips? Ω = {HHH,HHT,HTH,THH, HTT, THT, TTH, TTT} What is the event space we are interested in?

Florian Hollenbach 12

slide-24
SLIDE 24

Example

What is the probability of 2 head in 3 flips? Ω = {HHH,HHT,HTH,THH, HTT, THT, TTH, TTT} What is the event space we are interested in? {HHT, HTH, THH}

Florian Hollenbach 12

slide-25
SLIDE 25

Example

What is the probability of 2 head in 3 flips? Ω = {HHH,HHT,HTH,THH, HTT, THT, TTH, TTT} What is the event space we are interested in? {HHT, HTH, THH} P(2 H) = 3

8 Florian Hollenbach 12

slide-26
SLIDE 26

Axioms (rules) of Probability

  • the probability of any event A is at least 0
  • P(A) ≥ 0

Florian Hollenbach 13

slide-27
SLIDE 27

Axioms (rules) of Probability

  • the probability of any event A is at least 0
  • P(A) ≥ 0
  • The total sum of all possible outcomes in the sample space

must be 1

  • P(Ω) = 1

Florian Hollenbach 13

slide-28
SLIDE 28

Axioms (rules) of Probability

  • the probability of any event A is at least 0
  • P(A) ≥ 0
  • The total sum of all possible outcomes in the sample space

must be 1

  • P(Ω) = 1
  • If A and B are mutually exclusive (meaning only one or the
  • ther can happen), then P(A or B) = P(A) + P(B)

Florian Hollenbach 13

slide-29
SLIDE 29

Axioms (rules) of Probability

Ac - complement to A, i.e. part of sample space not in A Sometimes it is easier to calculate the probability of an event by using its complement

Florian Hollenbach 14

slide-30
SLIDE 30

Using the complement:

What is the probability of having at least one Tail on three coin flips? Ω = {HHH,HHT,HTH,THH, HTT, THT, TTH, TTT}

Florian Hollenbach 15

slide-31
SLIDE 31

Using the complement:

What is the probability of having at least one Tail on three coin flips? Ω = {HHH,HHT,HTH,THH, HTT, THT, TTH, TTT} P(at least one T) = 7

8

P(at least one T) = 1 - P(HHH) = 1 - 1

8 Florian Hollenbach 15

slide-32
SLIDE 32

Example of simple probability

What is the probability of getting a Queen as the first card from a full deck? Ω = {?} Event space = {?}

Florian Hollenbach 16

slide-33
SLIDE 33

Example of simple probability

What is the probability of getting a Queen as the first card from a full deck? Ω = {?} Event space = {?} p(Queen) =

4 52 = 1 13 Florian Hollenbach 16

slide-34
SLIDE 34

How to quickly count the sample space when order matters: permutations

  • Often we do not want to or can’t write out all possible

combinations by hand

  • How many possibilities are there to arrange letters A,B,C?

Florian Hollenbach 17

slide-35
SLIDE 35

How to quickly count the sample space when order matters: permutations

  • Often we do not want to or can’t write out all possible

combinations by hand

  • How many possibilities are there to arrange letters A,B,C?

Three outcomes: A, B, C & three draws

Florian Hollenbach 17

slide-36
SLIDE 36

How to quickly count the sample space when order matters: permutations

  • Often we do not want to or can’t write out all possible

combinations by hand

  • How many possibilities are there to arrange letters A,B,C?

Three outcomes: A, B, C & three draws First draw: A,B, or C Second draw: two possibilities Third draw: one left 3 x 2 x 1 possibilities

Florian Hollenbach 17

slide-37
SLIDE 37

How to quickly count the sample space when order matters: permutations

Permutations count many ways we can order k objects out of a set

  • f n unique objects

nPk = n × (n − 1) × (n − 2) × ... × (n − k + 1) = n! (n−k)!

What does n! stand for?

Florian Hollenbach 18

slide-38
SLIDE 38

How to quickly count the sample space when order matters: permutations

Permutations count many ways we can order k objects out of a set

  • f n unique objects

nPk = n × (n − 1) × (n − 2) × ... × (n − k + 1) = n! (n−k)!

What does n! stand for? n! = n-factorial = n × (n − 1) × (n − 2) × ... × (n − n + 1) 3! = 3 × 2 × 1 Note: 0! = 1

Florian Hollenbach 18

slide-39
SLIDE 39

Permutation Example:

How many ways can we arrange four cards out of a the 13 spades in our card deck? first draw: ?

Florian Hollenbach 19

slide-40
SLIDE 40

Permutation Example:

How many ways can we arrange four cards out of a the 13 spades in our card deck? first draw: ? 13 × 12 × 11 × 10

Florian Hollenbach 19

slide-41
SLIDE 41

Permutation Example:

How many ways can we arrange four cards out of a the 13 spades in our card deck? first draw: ? 13 × 12 × 11 × 10

13! (13−4)! = 13! 9! = 13×12×11×...×2×1 9×8×...×2×1

= 13 × 12 × 11 × 10 = 17, 160

Florian Hollenbach 19

slide-42
SLIDE 42

Birthday Problem

Impress your family over Thanksgiving!

Florian Hollenbach 20

slide-43
SLIDE 43

Birthday Problem

Impress your family over Thanksgiving! What is the probability that at least two people in this room have the same birthday? How could we figure that out?

Florian Hollenbach 20

slide-44
SLIDE 44

Birthday Problem

Can the law of total probabilities and complement help us?

Florian Hollenbach 21

slide-45
SLIDE 45

Birthday Problem

Can the law of total probabilities and complement help us? Yes, P(at least two share bday) = 1 - P(nobody shares bday)

Florian Hollenbach 21

slide-46
SLIDE 46

Birthday Problem

P(nobody shares bday)? What is the event space?

Florian Hollenbach 22

slide-47
SLIDE 47

Birthday Problem

P(nobody shares bday)? What is the event space? Event space: everyone has a unique birthday. How many different possibilities?

Florian Hollenbach 22

slide-48
SLIDE 48

Birthday Problem

P(nobody shares bday)? What is the event space? Event space: everyone has a unique birthday. How many different possibilities? How many possibilities for birthdays in a year?

Florian Hollenbach 22

slide-49
SLIDE 49

Birthday Problem

P(nobody shares bday)? What is the event space? Event space: everyone has a unique birthday. How many different possibilities? How many possibilities for birthdays in a year? 365

Florian Hollenbach 22

slide-50
SLIDE 50

Birthday Problem

P(nobody shares bday)? What is the event space? Event space: everyone has a unique birthday. How many different possibilities? How many possibilities for birthdays in a year? 365 How many unique arrangements would we need for nobody to share the birthday? number of people in room - k

Florian Hollenbach 22

slide-51
SLIDE 51

Birthday Problem

  • 1. 365Pk =

365! (365−k)! possibilities to arrange k unique birthdays

  • ver 365 days
  • 2. What is the sample space? All the different possibilities for k

birthdays (even non-unique).

Florian Hollenbach 23

slide-52
SLIDE 52

Birthday Problem

  • 1. 365Pk =

365! (365−k)! possibilities to arrange k unique birthdays

  • ver 365 days
  • 2. What is the sample space? All the different possibilities for k

birthdays (even non-unique). 365k

Florian Hollenbach 23

slide-53
SLIDE 53

Birthday Problem

P(at least two share bday) = 1 - P(nobody shares bday) = 1 -

365! (365−k)!×365k Florian Hollenbach 24

slide-54
SLIDE 54

Birthday Problem

P(at least two share bday) = 1 - P(nobody shares bday) = 1 -

365! (365−k)!×365k

P(at least two share bday): k = 10; 0.116, k = 23; 0.504, and k = 68; 0.999.

Florian Hollenbach 24

slide-55
SLIDE 55

Combinations

Combinations are similar to permutations, except that the ordering doesn’t matter So with respect to combinations of 3 out of 26 letters, ABC, BAC, CAB, etc are the same

Florian Hollenbach 25

slide-56
SLIDE 56

Combinations

Combinations are similar to permutations, except that the ordering doesn’t matter So with respect to combinations of 3 out of 26 letters, ABC, BAC, CAB, etc are the same There are always fewer combinations than permutations

Florian Hollenbach 25

slide-57
SLIDE 57

Combinations vs. Permutations

Draw 2 out of letters ABC Permutations:

Florian Hollenbach 26

slide-58
SLIDE 58

Combinations vs. Permutations

Draw 2 out of letters ABC Permutations: AB, AC, BA, BC, CA, CB = 3!

1!

Combinations:

Florian Hollenbach 26

slide-59
SLIDE 59

Combinations vs. Permutations

Draw 2 out of letters ABC Permutations: AB, AC, BA, BC, CA, CB = 3!

1!

Combinations: AB, AC, BC

Florian Hollenbach 26

slide-60
SLIDE 60

How to Calculate Combinations

Calculate permutations and then account for the fact that we

  • vercounted due to ordering

Get rid of counts of different arrangements of same combination: divide by k!

nCk =

n

k

  • = nPk

k! = n! k!(n−k)! Florian Hollenbach 27

slide-61
SLIDE 61

How to Calculate Combinations

Calculate permutations and then account for the fact that we

  • vercounted due to ordering

Get rid of counts of different arrangements of same combination: divide by k!

nCk =

n

k

  • = nPk

k! = n! k!(n−k)!

Why divide by k! ?

Florian Hollenbach 27

slide-62
SLIDE 62

How to Calculate Combinations

Calculate permutations and then account for the fact that we

  • vercounted due to ordering

Get rid of counts of different arrangements of same combination: divide by k!

nCk =

n

k

  • = nPk

k! = n! k!(n−k)!

Why divide by k! ? for two sampled elements, we have 2!(= 2×1 = 2): A, B = AB, BA

Florian Hollenbach 27

slide-63
SLIDE 63

Lottery

What is the probability of winning (simplified) Mega Millions? Pick five numbers between 1 and 70 Probability of getting 5 correct?

Florian Hollenbach 28

slide-64
SLIDE 64

Lottery

Probability of getting 5 correct? What is the size of the event space?

Florian Hollenbach 29

slide-65
SLIDE 65

Lottery

Probability of getting 5 correct? What is the size of the event space? 1 ticket

Florian Hollenbach 29

slide-66
SLIDE 66

Lottery

Pick five numbers between 1 and 70 Sample space?

Florian Hollenbach 30

slide-67
SLIDE 67

Lottery

Pick five numbers between 1 and 70 Sample space? 70

5

  • =

70! 5!×(70−5)! = 70! 5!×65! Florian Hollenbach 30

slide-68
SLIDE 68

Lottery

Pick five numbers between 1 and 70 Sample space? 70

5

  • =

70! 5!×(70−5)! = 70! 5!×65!

12,103,014

Florian Hollenbach 30

slide-69
SLIDE 69

Lottery

n

k

  • in R

choose(n,k) choose(70,5) [1] 12103014

Florian Hollenbach 31

slide-70
SLIDE 70

Samping with and without Replacement

Two ways to sample (draw) data:

  • with replacement: put draw back in box
  • without replacement: keep draw, ticket can not be drawn again

Florian Hollenbach 32

slide-71
SLIDE 71

Samping with and without Replacement

Two ways to sample (draw) data:

  • with replacement: put draw back in box
  • without replacement: keep draw, ticket can not be drawn again

If we are sampling for a survey, what technique do we use?

Florian Hollenbach 32

slide-72
SLIDE 72

Simulating the birthday problem in R

  • Instead of calculating probabilities, we can often simulate them

in R

  • Use R to draw k birthdays and see whether any duplicates exist

Florian Hollenbach 33

slide-73
SLIDE 73

Simulating the birthday problem in R

  • Instead of calculating probabilities, we can often simulate them

in R

  • Use R to draw k birthdays and see whether any duplicates exist
  • We repeat the experiment over and over (~ 1000 times). The

share of experiments in which we found duplicates, will represent P(at least one shared bday)

Florian Hollenbach 33

slide-74
SLIDE 74

Simulating the birthday problem in R

k <- 23 # number of people sims <- 1000 # number of simulations event <- 0 # counter for (i in 1:sims) { days <- sample(1:365, k, replace = TRUE) days.unique <- unique(days) # unique birthdays if (length(days.unique) < k) { event <- event + 1 } } event / sims [1] 0.499

Florian Hollenbach 34

slide-75
SLIDE 75

Simulating the birthday problem in R

The larger the number of simulation iterations, the better the accuracy sims <- 10000 # number of simulations event <- 0 # counter for (i in 1:sims) { days <- sample(1:365, k, replace = TRUE) days.unique <- unique(days) # unique birthdays if (length(days.unique) < k) { event <- event + 1 }} event / sims [1] 0.5181

Florian Hollenbach 35