CMU 15-251 Probability I Teachers: Anil Ada Ariel Procaccia (this - - PowerPoint PPT Presentation

β–Ά
cmu 15 251
SMART_READER_LITE
LIVE PREVIEW

CMU 15-251 Probability I Teachers: Anil Ada Ariel Procaccia (this - - PowerPoint PPT Presentation

CMU 15-251 Probability I Teachers: Anil Ada Ariel Procaccia (this time) Course overview 2 Gambling 101 5 7 8 3 5 5 5 1 7 1 8 2 8 3 3 3 5 7 2 9 5 7 2 9 3 Gambling 101 4 5 1 = 0.518


slide-1
SLIDE 1

CMU 15-251

Probability I

Teachers: Anil Ada Ariel Procaccia (this time)

slide-2
SLIDE 2

Course overview

2

slide-3
SLIDE 3

Gambling 101

  • 3

7 7 1 7 7 1 5 5 5 5 5 5 3 3 3 9 9 3 8 2 8 2 2 8

slide-4
SLIDE 4

Gambling 101

  • 1 βˆ’

5 6 4

= 0.518

4

slide-5
SLIDE 5

Gambling 101

  • 1 βˆ’

35 36 24

= 0.491

  • 5
slide-6
SLIDE 6

Gambling 101

6

slide-7
SLIDE 7

Pennies and gold

  • 1.

1/6

2.

1/3

3.

2/3

4.

1

7

slide-8
SLIDE 8

Language of probability

8

slide-9
SLIDE 9

Language of probability

  • 𝑇
  • π‘ž

π‘¦βˆˆπ‘‡

π‘ž 𝑦 = 1

9

0.1 0.5 𝑇 0.2 0.2

slide-10
SLIDE 10

Language of probability

  • 𝐹 βŠ† 𝑇
  • Pr 𝐹 = π‘¦βˆˆπΉ π‘ž(𝑦)
  • 𝑦 ∈ 𝑇

Pr 𝐹 =

π‘¦βˆˆπΉ

π‘ž 𝑦 = |𝐹| |𝑇|

10

0.1 0.2 0.5 0.2 𝑇 Pr 𝐹 = 0.6

slide-11
SLIDE 11

Language of probability

  • 𝑇 =

{ 1,1 , 1,2 , 1,3 , 1,4 , 1,5 , 1,6 , 2,1 , 2,2 , 2,3 , 2,4 , 2,5 , 2,6 , 3,1 , 3,2 , 3,3 , 3,4 , 3,5 , 3,6 , 4,1 , 4,2 , 4,3 , 4,4 , 4,5 , 4,6 , 5,1 , 5,2 , 5,3 , 5,4 , 5,5 , 5,6 , 6,1 , 6,2 , 6,3 , 6,4 , 6,5 , (6,6)}

  • 1.

1/9

2.

2/9

3.

3/9

4.

4/9

11

slide-12
SLIDE 12

Conditional probability

  • 𝐡

𝐢 Pr 𝐡 𝐢 = Pr[𝐡∩𝐢]

Pr[𝐢]

  • 𝐡 ∩ 𝐢

𝐢

12

0.1 0.2 0.5 0.2 𝑇 𝐡 𝐢 𝐡 ∩ 𝐢

slide-13
SLIDE 13

Pennies and gold, revisited

  • 𝐻𝑗

𝑗 ∈ {1,2}

  • Pr 𝐻1 =

1 2 , Pr 𝐻1 ∩ 𝐻2 = 1 3

  • Pr 𝐻2 𝐻1 =

1/3 1/2 = 2 3

13

slide-14
SLIDE 14

Conditional probability

  • Pr 𝐡 ∩ 𝐢 = Pr 𝐢 Γ— Pr[𝐡|𝐢]
  • 𝐡

𝐢 𝐢 𝐡 𝐢

  • Applying iteratively:

Pr 𝐡1 ∩ β‹― ∩ π΅π‘œ = Pr 𝐡1 Γ— Pr 𝐡2 𝐡1 Γ— β‹― Pr[π΅π‘œ|𝐡1, β‹― , π΅π‘œβˆ’1]

14

slide-15
SLIDE 15

bayes’ rule

  • Pr B Γ— Pr A B = Pr 𝐡 ∩ 𝐢 = Pr 𝐡 Γ— Pr[𝐢|𝐡]

15

Pr 𝐡 𝐢 = Pr 𝐡 Pr[𝐢|𝐡] Pr[𝐢]

slide-16
SLIDE 16

Monty Hall problem

  • 16
slide-17
SLIDE 17

Monty Hall problem

17

slide-18
SLIDE 18

Monty Hall problem

  • Pr 𝑄3 𝑃2 =

Pr[𝑄3] Pr[𝑃2|𝑄3] Pr[𝑃2]

  • Pr[𝑄3] =

1 3 , Pr 𝑃2 𝑄3 = 1,

Pr[𝑃2] = 1/2

  • Pr 𝑄3 𝑃2 = 2/3
  • 1.

3/15

2.

4/15

3.

5/15

4.

6/15

18

Pr 𝐡 𝐢 = Pr 𝐡 Pr[𝐢|𝐡] Pr[𝐢]

slide-19
SLIDE 19

Independence

  • 𝐡

𝐢 Pr 𝐡 𝐢 = Pr[𝐡]

  • 19
slide-20
SLIDE 20

The birthday paradox

  • 𝑛
  • 𝑇 = 1, … , 365 𝑛, s

𝑦 = (𝑦1, … 𝑦𝑛)

  • 𝐹 =

𝑦 ∈ 𝑇 βˆƒπ‘—, π‘˜, s.t. 𝑦𝑗 = π‘¦π‘˜}

20

slide-21
SLIDE 21

The birthday paradox

  • 𝐹
  • 𝐹
  • 𝐡𝑗

𝑗 1, … , 𝑗 βˆ’ 1

  • 𝐹 = 𝐡1 ∩ β‹― ∩ π΅π‘œ
  • Pr

𝐹 = Pr 𝐡1 Γ— Pr 𝐡2 𝐡1 Γ— β‹― Pr[π΅π‘œ|𝐡1, β‹― , π΅π‘œβˆ’1]

21

Pr 𝐡𝑗 𝐡1, … , π΅π‘—βˆ’1 ?

slide-22
SLIDE 22

The birthday paradox

  • 𝐡1 ∩ β‹― ∩ π΅π‘—βˆ’1

𝑗 βˆ’ 1

  • 𝑗 βˆ’ 1

𝑗

  • Pr 𝐡𝑗 𝐡1, … , π΅π‘—βˆ’1 = 365βˆ’(π‘—βˆ’1)

365

= 1 βˆ’ π‘—βˆ’1

365

  • Pr

𝐹 = 1 Γ— 1 βˆ’

1 365 Γ— β‹― Γ— 1 βˆ’ π‘›βˆ’1 365

  • Pr 𝐹 = 1 βˆ’ Pr[

𝐹]

22

slide-23
SLIDE 23

The birthday paradox

23

Pr 𝐹 : Pr 𝐹 :

slide-24
SLIDE 24

The birthday paradox

  • 1.

1/2

2.

0.75

3.

0.99999999999997

4.

1

24

slide-25
SLIDE 25

Birthday attack *

  • 𝑇

𝑙 𝑔(𝑇)

  • 𝑇1, 𝑇2

𝑔 𝑇1 = 𝑔 𝑇2

  • 𝑛
  • 𝑔(𝑛)
  • 𝑛

𝑛′ 𝑔 𝑛 = 𝑔(𝑛′)

25

slide-26
SLIDE 26

Birthday attack *

  • 1, … , 2160
  • 2160 = 280

26

slide-27
SLIDE 27

Birthday attack *

  • 263
  • 27
slide-28
SLIDE 28

Summary

  • 28