Foundations of Computer Science Lecture 21 Deviations from the Mean - - PowerPoint PPT Presentation

foundations of computer science lecture 21 deviations
SMART_READER_LITE
LIVE PREVIEW

Foundations of Computer Science Lecture 21 Deviations from the Mean - - PowerPoint PPT Presentation

Foundations of Computer Science Lecture 21 Deviations from the Mean How Good is the Expectation as a Sumary of a Random Variable? Variance: Uniform; Bernoulli; Binomial; Waiting Times. Variance of a Sum Law of Large Numbers: The 3- Rule


slide-1
SLIDE 1

Foundations of Computer Science Lecture 21 Deviations from the Mean

How Good is the Expectation as a Sumary of a Random Variable? Variance: Uniform; Bernoulli; Binomial; Waiting Times. Variance of a Sum Law of Large Numbers: The 3-σ Rule

slide-2
SLIDE 2

Last Time

1 Expected value of a Sum. ◮ Sum of dice ◮ Binomial ◮ Waiting time ◮ Coupon collecting. 2 Build-up expectation. 3 Expected value of a product. 4 Sum of Indicators. ◮ Random arrangement of hats on heads. Creator: Malik Magdon-Ismail Deviations from the Mean: 2 / 13 Today →

slide-3
SLIDE 3

Today: Deviations from the Mean

1

How well does the expected value (mean) summarize a random variable?

2

Variance.

3

Variance of a sum.

4

Law of large numbers

The 3-σ rule.

Creator: Malik Magdon-Ismail Deviations from the Mean: 3 / 13 Up to Now →

slide-4
SLIDE 4

Probability For Analyzing a Random Experiment.

Experiment (random)

slide-5
SLIDE 5

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex)

slide-6
SLIDE 6

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable)

slide-7
SLIDE 7

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable) Summary E[X] (expectation)

slide-8
SLIDE 8

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable) Summary E[X] (expectation) How good is E[X]?

Creator: Malik Magdon-Ismail Deviations from the Mean: 4 / 13 Average of n Dice →

slide-9
SLIDE 9

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable) Summary E[X] (expectation) How good is E[X]?

  • Experiment. Roll n dice and compute X, the average of the rolls.

Creator: Malik Magdon-Ismail Deviations from the Mean: 4 / 13 Average of n Dice →

slide-10
SLIDE 10

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable) Summary E[X] (expectation) How good is E[X]?

  • Experiment. Roll n dice and compute X, the average of the rolls.

E[average]

Creator: Malik Magdon-Ismail Deviations from the Mean: 4 / 13 Average of n Dice →

slide-11
SLIDE 11

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable) Summary E[X] (expectation) How good is E[X]?

  • Experiment. Roll n dice and compute X, the average of the rolls.

E[average] = E

1

n · sum

  • Creator: Malik Magdon-Ismail

Deviations from the Mean: 4 / 13 Average of n Dice →

slide-12
SLIDE 12

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable) Summary E[X] (expectation) How good is E[X]?

  • Experiment. Roll n dice and compute X, the average of the rolls.

E[average] = E

1

n · sum

  • =

1 n · E [sum]

Creator: Malik Magdon-Ismail Deviations from the Mean: 4 / 13 Average of n Dice →

slide-13
SLIDE 13

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable) Summary E[X] (expectation) How good is E[X]?

  • Experiment. Roll n dice and compute X, the average of the rolls.

E[average] = E

1

n · sum

  • =

1 n · E [sum] = 1 n × n × 31 2

Creator: Malik Magdon-Ismail Deviations from the Mean: 4 / 13 Average of n Dice →

slide-14
SLIDE 14

Probability For Analyzing a Random Experiment.

Experiment (random) Outcomes (complex) Measurement X (random variable) Summary E[X] (expectation) How good is E[X]?

  • Experiment. Roll n dice and compute X, the average of the rolls.

E[average] = E

1

n · sum

  • =

1 n · E [sum] = 1 n × n × 31 2 = 31 2.

Creator: Malik Magdon-Ismail Deviations from the Mean: 4 / 13 Average of n Dice →

slide-15
SLIDE 15

Average of n Dice

Number of dice n Average roll 1 10 102 103 104 105 1 2 3 3.5 4 5 6

slide-16
SLIDE 16

Average of n Dice

Number of dice n Average roll 1 10 102 103 104 105 1 2 3 3.5 4 5 6

Average of 4 dice Probability 1 2 3 3.5 4 5 6 0.1

σ

Average of 100 dice Probability 1 2 3 3.5 4 5 6 0.1

σ

Creator: Malik Magdon-Ismail Deviations from the Mean: 5 / 13 Variance →

slide-17
SLIDE 17

Variance: Size of the Deviations From the Mean

X = sum of 2 dice. E[X] = 7 ← µ(X)

Creator: Malik Magdon-Ismail Deviations from the Mean: 6 / 13 Risk →

slide-18
SLIDE 18

Variance: Size of the Deviations From the Mean

X = sum of 2 dice. E[X] = 7 ← µ(X)

X 2 3 4 5 6 7 8 9 10 11 12 ∆ −5 −4 −3 −2 −1 1 2 3 4 5 ← X − µ PX

1 36 2 36 3 36 4 36 5 36 6 36 5 36 4 36 3 36 2 36 1 36

Pop Quiz. What is E[∆]?

Creator: Malik Magdon-Ismail Deviations from the Mean: 6 / 13 Risk →

slide-19
SLIDE 19

Variance: Size of the Deviations From the Mean

X = sum of 2 dice. E[X] = 7 ← µ(X)

X 2 3 4 5 6 7 8 9 10 11 12 ∆ −5 −4 −3 −2 −1 1 2 3 4 5 ← X − µ PX

1 36 2 36 3 36 4 36 5 36 6 36 5 36 4 36 3 36 2 36 1 36

Pop Quiz. What is E[∆]?

Variance, σ2, is the expected value of the squared deviations,

σ2 = E[∆2] = E[(X − µ)2] = E[(X − E[X])2] σ2 = E[∆2] =

1 36·25 +

Creator: Malik Magdon-Ismail Deviations from the Mean: 6 / 13 Risk →

slide-20
SLIDE 20

Variance: Size of the Deviations From the Mean

X = sum of 2 dice. E[X] = 7 ← µ(X)

X 2 3 4 5 6 7 8 9 10 11 12 ∆ −5 −4 −3 −2 −1 1 2 3 4 5 ← X − µ PX

1 36 2 36 3 36 4 36 5 36 6 36 5 36 4 36 3 36 2 36 1 36

Pop Quiz. What is E[∆]?

Variance, σ2, is the expected value of the squared deviations,

σ2 = E[∆2] = E[(X − µ)2] = E[(X − E[X])2] σ2 = E[∆2] =

1 36·25 + 2 36·16 +

Creator: Malik Magdon-Ismail Deviations from the Mean: 6 / 13 Risk →

slide-21
SLIDE 21

Variance: Size of the Deviations From the Mean

X = sum of 2 dice. E[X] = 7 ← µ(X)

X 2 3 4 5 6 7 8 9 10 11 12 ∆ −5 −4 −3 −2 −1 1 2 3 4 5 ← X − µ PX

1 36 2 36 3 36 4 36 5 36 6 36 5 36 4 36 3 36 2 36 1 36

Pop Quiz. What is E[∆]?

Variance, σ2, is the expected value of the squared deviations,

σ2 = E[∆2] = E[(X − µ)2] = E[(X − E[X])2] σ2 = E[∆2] =

1 36·25 + 2 36·16 + 3 36·9 + 4 36·4 + 5 36·1 + 6 36·0 + 5 36·1 + 4 36·4 + 3 36·9 + 2 36·16 + 1 36·25

Creator: Malik Magdon-Ismail Deviations from the Mean: 6 / 13 Risk →

slide-22
SLIDE 22

Variance: Size of the Deviations From the Mean

X = sum of 2 dice. E[X] = 7 ← µ(X)

X 2 3 4 5 6 7 8 9 10 11 12 ∆ −5 −4 −3 −2 −1 1 2 3 4 5 ← X − µ PX

1 36 2 36 3 36 4 36 5 36 6 36 5 36 4 36 3 36 2 36 1 36

Pop Quiz. What is E[∆]?

Variance, σ2, is the expected value of the squared deviations,

σ2 = E[∆2] = E[(X − µ)2] = E[(X − E[X])2] σ2 = E[∆2] =

1 36·25 + 2 36·16 + 3 36·9 + 4 36·4 + 5 36·1 + 6 36·0 + 5 36·1 + 4 36·4 + 3 36·9 + 2 36·16 + 1 36·25

= 55

6.

Creator: Malik Magdon-Ismail Deviations from the Mean: 6 / 13 Risk →

slide-23
SLIDE 23

Variance: Size of the Deviations From the Mean

X = sum of 2 dice. E[X] = 7 ← µ(X)

X 2 3 4 5 6 7 8 9 10 11 12 ∆ −5 −4 −3 −2 −1 1 2 3 4 5 ← X − µ PX

1 36 2 36 3 36 4 36 5 36 6 36 5 36 4 36 3 36 2 36 1 36

Pop Quiz. What is E[∆]?

Variance, σ2, is the expected value of the squared deviations,

σ2 = E[∆2] = E[(X − µ)2] = E[(X − E[X])2] σ2 = E[∆2] =

1 36·25 + 2 36·16 + 3 36·9 + 4 36·4 + 5 36·1 + 6 36·0 + 5 36·1 + 4 36·4 + 3 36·9 + 2 36·16 + 1 36·25

= 55

6.

Standard Deviation, σ, is the square-root of the variance,

σ =

  • E[∆2] =
  • E[(X − µ)2] =
  • E[(X − E[X])2]

σ =

  • 55

6 ≈ 2.52

sum of two dice rolls = 7 ± 2.52.

  • Practice. Exercise 21.2.

Creator: Malik Magdon-Ismail Deviations from the Mean: 6 / 13 Risk →

slide-24
SLIDE 24

Variance is a Measure of Risk

Game 1 Game 2

Creator: Malik Magdon-Ismail Deviations from the Mean: 7 / 13 More Convenient Variance →

slide-25
SLIDE 25

Variance is a Measure of Risk

Game 1 Game 2 X1 : win $2 probability = 2

3;

lose $1 probability = 1

3.

Creator: Malik Magdon-Ismail Deviations from the Mean: 7 / 13 More Convenient Variance →

slide-26
SLIDE 26

Variance is a Measure of Risk

Game 1 Game 2 X1 : win $2 probability = 2

3;

lose $1 probability = 1

3.

X2 : win $102 probability = 2

3;

lose $201 probability = 1

3.

Creator: Malik Magdon-Ismail Deviations from the Mean: 7 / 13 More Convenient Variance →

slide-27
SLIDE 27

Variance is a Measure of Risk

Game 1 Game 2 X1 : win $2 probability = 2

3;

lose $1 probability = 1

3.

X2 : win $102 probability = 2

3;

lose $201 probability = 1

3.

E[X1] = $1

Creator: Malik Magdon-Ismail Deviations from the Mean: 7 / 13 More Convenient Variance →

slide-28
SLIDE 28

Variance is a Measure of Risk

Game 1 Game 2 X1 : win $2 probability = 2

3;

lose $1 probability = 1

3.

X2 : win $102 probability = 2

3;

lose $201 probability = 1

3.

E[X1] = $1 E[X2] = $1

Creator: Malik Magdon-Ismail Deviations from the Mean: 7 / 13 More Convenient Variance →

slide-29
SLIDE 29

Variance is a Measure of Risk

Game 1 Game 2 X1 : win $2 probability = 2

3;

lose $1 probability = 1

3.

X2 : win $102 probability = 2

3;

lose $201 probability = 1

3.

E[X1] = $1 E[X2] = $1 σ2(X1) =

2 3 · (2 − 1)2 + 1 3 · (−1 − 1)2

= 2

Creator: Malik Magdon-Ismail Deviations from the Mean: 7 / 13 More Convenient Variance →

slide-30
SLIDE 30

Variance is a Measure of Risk

Game 1 Game 2 X1 : win $2 probability = 2

3;

lose $1 probability = 1

3.

X2 : win $102 probability = 2

3;

lose $201 probability = 1

3.

E[X1] = $1 E[X2] = $1 σ2(X1) =

2 3 · (2 − 1)2 + 1 3 · (−1 − 1)2

= 2 σ2(X2) =

2 3 · (102 − 1)2 + 1 3 · (−201 − 1)2

≈ 2 × 104.

Creator: Malik Magdon-Ismail Deviations from the Mean: 7 / 13 More Convenient Variance →

slide-31
SLIDE 31

Variance is a Measure of Risk

Game 1 Game 2 X1 : win $2 probability = 2

3;

lose $1 probability = 1

3.

X2 : win $102 probability = 2

3;

lose $201 probability = 1

3.

E[X1] = $1 E[X2] = $1 σ2(X1) =

2 3 · (2 − 1)2 + 1 3 · (−1 − 1)2

= 2 σ2(X2) =

2 3 · (102 − 1)2 + 1 3 · (−201 − 1)2

≈ 2 × 104.

X1 = 1 ± 1.41 X2 = 1 ± 141

For a small expected profit you might risk a small loss (Game 1), not a huge loss.

Creator: Malik Magdon-Ismail Deviations from the Mean: 7 / 13 More Convenient Variance →

slide-32
SLIDE 32

A More Convenient Formula for Variance

σ2 = E[(X − µ)2]

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-33
SLIDE 33

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-34
SLIDE 34

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-35
SLIDE 35

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-36
SLIDE 36

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Variance:

σ2 = E[X2] − µ2 = E[X2] − E[X]2.

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-37
SLIDE 37

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Variance:

σ2 = E[X2] − µ2 = E[X2] − E[X]2.

Sum of two dice,

E[X2] =

12

  • x=2 PX(x) · x2

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-38
SLIDE 38

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Variance:

σ2 = E[X2] − µ2 = E[X2] − E[X]2.

Sum of two dice,

E[X2] =

12

  • x=2 PX(x) · x2

=

1 36·22 +

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-39
SLIDE 39

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Variance:

σ2 = E[X2] − µ2 = E[X2] − E[X]2.

Sum of two dice,

E[X2] =

12

  • x=2 PX(x) · x2

=

1 36·22 + 2 36·32 +

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-40
SLIDE 40

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Variance:

σ2 = E[X2] − µ2 = E[X2] − E[X]2.

Sum of two dice,

E[X2] =

12

  • x=2 PX(x) · x2

=

1 36·22 + 2 36·32 + 3 36·42 + 4 36·52 + 5 36·62 + 6 36·72 + 5 36·82 + 4 36·92 + 3 36·102 + 2 36·112 + 1 36·122

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-41
SLIDE 41

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Variance:

σ2 = E[X2] − µ2 = E[X2] − E[X]2.

Sum of two dice,

E[X2] =

12

  • x=2 PX(x) · x2

=

1 36·22 + 2 36·32 + 3 36·42 + 4 36·52 + 5 36·62 + 6 36·72 + 5 36·82 + 4 36·92 + 3 36·102 + 2 36·112 + 1 36·122

= 545

6

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-42
SLIDE 42

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Variance:

σ2 = E[X2] − µ2 = E[X2] − E[X]2.

Sum of two dice,

E[X2] =

12

  • x=2 PX(x) · x2

=

1 36·22 + 2 36·32 + 3 36·42 + 4 36·52 + 5 36·62 + 6 36·72 + 5 36·82 + 4 36·92 + 3 36·102 + 2 36·112 + 1 36·122

= 545

6

Since µ = 7

σ2 = 545

6 − 72 = 55 6

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-43
SLIDE 43

A More Convenient Formula for Variance

σ2 = E[(X − µ)2] = E[X2 − 2µX + µ2]

← Expand (X − µ)2

= E[X2] − 2µ E [X] + µ2

← Linearity of expectation

= E[X2] − µ2.

← E[X] = µ

Variance:

σ2 = E[X2] − µ2 = E[X2] − E[X]2.

Sum of two dice,

E[X2] =

12

  • x=2 PX(x) · x2

=

1 36·22 + 2 36·32 + 3 36·42 + 4 36·52 + 5 36·62 + 6 36·72 + 5 36·82 + 4 36·92 + 3 36·102 + 2 36·112 + 1 36·122

= 545

6

Since µ = 7

σ2 = 545

6 − 72 = 55 6

  • Theorem. Variance ≥ 0, which means E[X2] ≥ E[X]2 for any random variable X.

Creator: Malik Magdon-Ismail Deviations from the Mean: 8 / 13 Variance of Uniform and Bernoulli →

slide-44
SLIDE 44

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-45
SLIDE 45

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2]

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-46
SLIDE 46

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2)

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-47
SLIDE 47

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-48
SLIDE 48

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

so

σ2(Uniform) = E[X2] − E[X]2

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-49
SLIDE 49

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

so

σ2(Uniform) = E[X2] − E[X]2 =

1 6(n + 1)(2n + 1) − (1 2(n + 1))2

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-50
SLIDE 50

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

so

σ2(Uniform) = E[X2] − E[X]2 =

1 6(n + 1)(2n + 1) − (1 2(n + 1))2 = 1 12(n2 − 1).

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-51
SLIDE 51

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

so

σ2(Uniform) = E[X2] − E[X]2 =

1 6(n + 1)(2n + 1) − (1 2(n + 1))2 = 1 12(n2 − 1).

  • Bernoulli. We saw earlier that E[X] = p.

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-52
SLIDE 52

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

so

σ2(Uniform) = E[X2] − E[X]2 =

1 6(n + 1)(2n + 1) − (1 2(n + 1))2 = 1 12(n2 − 1).

  • Bernoulli. We saw earlier that E[X] = p.

E[X2]

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-53
SLIDE 53

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

so

σ2(Uniform) = E[X2] − E[X]2 =

1 6(n + 1)(2n + 1) − (1 2(n + 1))2 = 1 12(n2 − 1).

  • Bernoulli. We saw earlier that E[X] = p.

E[X2] = p · 12 + (1 − p) · 02

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-54
SLIDE 54

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

so

σ2(Uniform) = E[X2] − E[X]2 =

1 6(n + 1)(2n + 1) − (1 2(n + 1))2 = 1 12(n2 − 1).

  • Bernoulli. We saw earlier that E[X] = p.

E[X2] = p · 12 + (1 − p) · 02 = p

so

σ2(Bernoulli) = E[X2] − E[X]2

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-55
SLIDE 55

Variance of Uniform and Bernoulli

  • Uniform. We saw earlier that E[X] = 1

2(n + 1).

E[X2] = 1

n(12 + · · · + n2) = 1 n × n 6(n + 1)(2n + 1) = 1 6(n + 1)(2n + 1)

so

σ2(Uniform) = E[X2] − E[X]2 =

1 6(n + 1)(2n + 1) − (1 2(n + 1))2 = 1 12(n2 − 1).

  • Bernoulli. We saw earlier that E[X] = p.

E[X2] = p · 12 + (1 − p) · 02 = p

so

σ2(Bernoulli) = E[X2] − E[X]2 = p − p2 = p(1 − p).

Creator: Malik Magdon-Ismail Deviations from the Mean: 9 / 13 Linearity of Variance? →

slide-56
SLIDE 56

Linearity of Variance?

Creator: Malik Magdon-Ismail Deviations from the Mean: 10 / 13 Variance of a Sum →

slide-57
SLIDE 57

Linearity of Variance?

Let X be a Bernoulli and Y = a + X (a is a constant):

Y =

      

a + 1 with probability p; a with probability 1 − p.

E[Y] = p · (a + 1) + (1 − p) · a = a + p = a + E[X]

(as expected)

Creator: Malik Magdon-Ismail Deviations from the Mean: 10 / 13 Variance of a Sum →

slide-58
SLIDE 58

Linearity of Variance?

Let X be a Bernoulli and Y = a + X (a is a constant):

Y =

      

a + 1 with probability p; a with probability 1 − p.

E[Y] = p · (a + 1) + (1 − p) · a = a + p = a + E[X]

(as expected)

Deviations from the mean µ = a + p: ∆Y =

          

1 − p

with probability p;

−p

with probability 1 − p,

(deviations independent of a!)

Creator: Malik Magdon-Ismail Deviations from the Mean: 10 / 13 Variance of a Sum →

slide-59
SLIDE 59

Linearity of Variance?

Let X be a Bernoulli and Y = a + X (a is a constant):

Y =

      

a + 1 with probability p; a with probability 1 − p.

E[Y] = p · (a + 1) + (1 − p) · a = a + p = a + E[X]

(as expected)

Deviations from the mean µ = a + p: ∆Y =

          

1 − p

with probability p;

−p

with probability 1 − p,

(deviations independent of a!)

Therefore σ2(Y) = σ2(X).

Creator: Malik Magdon-Ismail Deviations from the Mean: 10 / 13 Variance of a Sum →

slide-60
SLIDE 60

Linearity of Variance?

Let X be a Bernoulli and Y = a + X (a is a constant):

Y =

      

a + 1 with probability p; a with probability 1 − p.

E[Y] = p · (a + 1) + (1 − p) · a = a + p = a + E[X]

(as expected)

Deviations from the mean µ = a + p: ∆Y =

          

1 − p

with probability p;

−p

with probability 1 − p,

(deviations independent of a!)

Therefore σ2(Y) = σ2(X).

Pop Quiz. Y = bX. Compute E[Y] and σ2(Y).

Creator: Malik Magdon-Ismail Deviations from the Mean: 10 / 13 Variance of a Sum →

slide-61
SLIDE 61

Linearity of Variance?

Let X be a Bernoulli and Y = a + X (a is a constant):

Y =

      

a + 1 with probability p; a with probability 1 − p.

E[Y] = p · (a + 1) + (1 − p) · a = a + p = a + E[X]

(as expected)

Deviations from the mean µ = a + p: ∆Y =

          

1 − p

with probability p;

−p

with probability 1 − p,

(deviations independent of a!)

Therefore σ2(Y) = σ2(X).

Pop Quiz. Y = bX. Compute E[Y] and σ2(Y).

  • Theorem. Let Y = a + bX. Then,

σ2(Y) = b2σ2(X).

Creator: Malik Magdon-Ismail Deviations from the Mean: 10 / 13 Variance of a Sum →

slide-62
SLIDE 62

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-63
SLIDE 63

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 (∗) is by linearity of expectation.

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-64
SLIDE 64

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; (∗) is by linearity of expectation.

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-65
SLIDE 65

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] (∗) is by linearity of expectation.

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-66
SLIDE 66

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] = E[X2

1 + X2 2 + 2X1X2]

(∗) is by linearity of expectation.

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-67
SLIDE 67

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] = E[X2

1 + X2 2 + 2X1X2] (∗)

= E [X2

1] + E[X2 2] + 2 E [X1X2].

(∗) is by linearity of expectation.

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-68
SLIDE 68

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] = E[X2

1 + X2 2 + 2X1X2] (∗)

= E [X2

1] + E[X2 2] + 2 E [X1X2].

(∗) is by linearity of expectation. σ2(X) = E[X2] − E[X]2

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-69
SLIDE 69

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] = E[X2

1 + X2 2 + 2X1X2] (∗)

= E [X2

1] + E[X2 2] + 2 E [X1X2].

(∗) is by linearity of expectation. σ2(X) = E[X2] − E[X]2 = (E[X2

1] + E[X2 2] + 2 E [X1X2]) − (E[X1]2 + E[X2]2 + 2 E [X1] E [X2])

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-70
SLIDE 70

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] = E[X2

1 + X2 2 + 2X1X2] (∗)

= E [X2

1] + E[X2 2] + 2 E [X1X2].

(∗) is by linearity of expectation. σ2(X) = E[X2] − E[X]2 = (E[X2

1] + E[X2 2] + 2 E [X1X2]) − (E[X1]2 + E[X2]2 + 2 E [X1] E [X2])

= E[X2

1] − E[X1]2

  • σ2(X1)

+ E[X2

2] − E[X2]2

  • σ2(X2)

+2 (E[X1X2] − E[X1] E [X2])

  • 0 if X1 and X2 are independent

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-71
SLIDE 71

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] = E[X2

1 + X2 2 + 2X1X2] (∗)

= E [X2

1] + E[X2 2] + 2 E [X1X2].

(∗) is by linearity of expectation. σ2(X) = E[X2] − E[X]2 = (E[X2

1] + E[X2 2] + 2 E [X1X2]) − (E[X1]2 + E[X2]2 + 2 E [X1] E [X2])

= E[X2

1] − E[X1]2

  • σ2(X1)

+ E[X2

2] − E[X2]2

  • σ2(X2)

+2 (E[X1X2] − E[X1] E [X2])

  • 0 if X1 and X2 are independent

Variance of a Sum. For independent random variables, the variance of the sum is a sum of the variances.

  • Practice. Compute the variance of 1 dice roll. Compute the variance of the sum of n dice rolls.

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-72
SLIDE 72

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] = E[X2

1 + X2 2 + 2X1X2] (∗)

= E [X2

1] + E[X2 2] + 2 E [X1X2].

(∗) is by linearity of expectation. σ2(X) = E[X2] − E[X]2 = (E[X2

1] + E[X2 2] + 2 E [X1X2]) − (E[X1]2 + E[X2]2 + 2 E [X1] E [X2])

= E[X2

1] − E[X1]2

  • σ2(X1)

+ E[X2

2] − E[X2]2

  • σ2(X2)

+2 (E[X1X2] − E[X1] E [X2])

  • 0 if X1 and X2 are independent

Variance of a Sum. For independent random variables, the variance of the sum is a sum of the variances.

  • Practice. Compute the variance of 1 dice roll. Compute the variance of the sum of n dice rolls.
  • Example. The Variance of the Binomial (sum of independent Bernoullis)

X = X1 + · · · + Xn (sum of independent Bernoullis), and σ2(Xi) = p(1 − p)

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-73
SLIDE 73

Variance of a Sum

X = X1 + X2

E[X]2 = E[X1 + X2]2 (∗) = (E[X1] + E[X2])2 = E[X1]2 + E[X2]2 + 2 E [X1] E [X2]; E [X2] = E[(X1 + X2)2] = E[X2

1 + X2 2 + 2X1X2] (∗)

= E [X2

1] + E[X2 2] + 2 E [X1X2].

(∗) is by linearity of expectation. σ2(X) = E[X2] − E[X]2 = (E[X2

1] + E[X2 2] + 2 E [X1X2]) − (E[X1]2 + E[X2]2 + 2 E [X1] E [X2])

= E[X2

1] − E[X1]2

  • σ2(X1)

+ E[X2

2] − E[X2]2

  • σ2(X2)

+2 (E[X1X2] − E[X1] E [X2])

  • 0 if X1 and X2 are independent

Variance of a Sum. For independent random variables, the variance of the sum is a sum of the variances.

  • Practice. Compute the variance of 1 dice roll. Compute the variance of the sum of n dice rolls.
  • Example. The Variance of the Binomial (sum of independent Bernoullis)

X = X1 + · · · + Xn (sum of independent Bernoullis), and σ2(Xi) = p(1 − p) σ2(Binomial) = σ2(X1) + · · · + σ2(Xn) = p(1 − p) + · · · + p(1 − p) = np(1 − p).

Creator: Malik Magdon-Ismail Deviations from the Mean: 11 / 13 3-σ Rule →

slide-74
SLIDE 74

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-75
SLIDE 75

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-76
SLIDE 76

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X]

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-77
SLIDE 77

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x)

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-78
SLIDE 78

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x)

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-79
SLIDE 79

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x) ≥
  • x≥α α · PX(x)

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-80
SLIDE 80

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x) ≥
  • x≥α α · PX(x) = α · P[X ≥ α].

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-81
SLIDE 81

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x) ≥
  • x≥α α · PX(x) = α · P[X ≥ α].

Lemma (Chebyshev Inequality).

P[|∆| ≥ tσ] ≤ 1 t2.

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-82
SLIDE 82

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x) ≥
  • x≥α α · PX(x) = α · P[X ≥ α].

Lemma (Chebyshev Inequality).

P[|∆| ≥ tσ] ≤ 1 t2.

Proof. P[|∆| ≥ tσ]

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-83
SLIDE 83

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x) ≥
  • x≥α α · PX(x) = α · P[X ≥ α].

Lemma (Chebyshev Inequality).

P[|∆| ≥ tσ] ≤ 1 t2.

Proof. P[|∆| ≥ tσ] = P[∆2 ≥ t2σ2]

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-84
SLIDE 84

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x) ≥
  • x≥α α · PX(x) = α · P[X ≥ α].

Lemma (Chebyshev Inequality).

P[|∆| ≥ tσ] ≤ 1 t2.

Proof. P[|∆| ≥ tσ] = P[∆2 ≥ t2σ2]

(a)

≤ E[∆2] t2σ2

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-85
SLIDE 85

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x) ≥
  • x≥α α · PX(x) = α · P[X ≥ α].

Lemma (Chebyshev Inequality).

P[|∆| ≥ tσ] ≤ 1 t2.

Proof. P[|∆| ≥ tσ] = P[∆2 ≥ t2σ2]

(a)

≤ E[∆2] t2σ2 = σ2 t2σ2

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-86
SLIDE 86

3-σ Rule: X = µ(X) ± σ(X)

3-σ Rule. For any random variable X, the chances are at least (about) 90% that

µ − 3σ < X < µ + 3σ

  • r

X = µ ± 3σ.

Lemma (Markov Inequality). For a positive random variable X,

P[X ≥ α] ≤ E[X] α .

Proof. E[X] =

  • x≥0 x · PX(x) ≥
  • x≥α x · PX(x) ≥
  • x≥α α · PX(x) = α · P[X ≥ α].

Lemma (Chebyshev Inequality).

P[|∆| ≥ tσ] ≤ 1 t2.

Proof. P[|∆| ≥ tσ] = P[∆2 ≥ t2σ2]

(a)

≤ E[∆2] t2σ2 = σ2 t2σ2 = 1 t2. In (a) we used Markov’s Inequality.

To get the 3-σ rule, use Chebyshev’s Inequality with t = 3.

Creator: Malik Magdon-Ismail Deviations from the Mean: 12 / 13 Law of Large Numbers →

slide-87
SLIDE 87

Law of Large Numbers

Expectation of the average of n dice:

E[average] = E[ 1

n × sum] = 1 n × E[sum] = 1 n × n × 31 2

Creator: Malik Magdon-Ismail Deviations from the Mean: 13 / 13

slide-88
SLIDE 88

Law of Large Numbers

Expectation of the average of n dice:

E[average] = E[ 1

n × sum] = 1 n × E[sum] = 1 n × n × 31 2

Variance of the average of n dice:

σ2(average)

Creator: Malik Magdon-Ismail Deviations from the Mean: 13 / 13

slide-89
SLIDE 89

Law of Large Numbers

Expectation of the average of n dice:

E[average] = E[ 1

n × sum] = 1 n × E[sum] = 1 n × n × 31 2

Variance of the average of n dice:

σ2(average) = σ2( 1

n × sum)

Creator: Malik Magdon-Ismail Deviations from the Mean: 13 / 13

slide-90
SLIDE 90

Law of Large Numbers

Expectation of the average of n dice:

E[average] = E[ 1

n × sum] = 1 n × E[sum] = 1 n × n × 31 2

Variance of the average of n dice:

σ2(average) = σ2( 1

n × sum) = 1 n2 × σ2(sum)

Creator: Malik Magdon-Ismail Deviations from the Mean: 13 / 13

slide-91
SLIDE 91

Law of Large Numbers

Expectation of the average of n dice:

E[average] = E[ 1

n × sum] = 1 n × E[sum] = 1 n × n × 31 2

Variance of the average of n dice:

σ2(average) = σ2( 1

n × sum) = 1 n2 × σ2(sum) = 1 n2 × n × σ2(one die)

Creator: Malik Magdon-Ismail Deviations from the Mean: 13 / 13

slide-92
SLIDE 92

Law of Large Numbers

Expectation of the average of n dice:

E[average] = E[ 1

n × sum] = 1 n × E[sum] = 1 n × n × 31 2

Variance of the average of n dice:

σ2(average) = σ2( 1

n × sum) = 1 n2 × σ2(sum) = 1 n2 × n × σ2(one die) = 1 n × σ2(one die)

Creator: Malik Magdon-Ismail Deviations from the Mean: 13 / 13

slide-93
SLIDE 93

Law of Large Numbers

Expectation of the average of n dice:

E[average] = E[ 1

n × sum] = 1 n × E[sum] = 1 n × n × 31 2

Variance of the average of n dice:

σ2(average) = σ2( 1

n × sum) = 1 n2 × σ2(sum) = 1 n2 × n × σ2(one die) = 1 n × σ2(one die)

n 3-sigma range [µ − 3σ, µ + 3σ] 1 10 102 103 104

1

31

2

6

Creator: Malik Magdon-Ismail Deviations from the Mean: 13 / 13