16 sequences

22
Hadley Wickham Stat310 Sequences of rvs Wednesday, 17 March 2010

Upload: hadley-wickham

Post on 13-May-2015

551 views

Category:

Technology


0 download

TRANSCRIPT

Page 1: 16 Sequences

Hadley Wickham

Stat310Sequences of rvs

Wednesday, 17 March 2010

Page 2: 16 Sequences

Major’s day

2:30-4:30pm Today

Oshman Engineering Design Kitchen

Come along and talk to me (or Rudy Guerra) if you’re interested in becoming a stat major

Wednesday, 17 March 2010

Page 3: 16 Sequences

Assessment

Test model answers online tonight (hopefully)

Usual help session tonight 4-5pm.

Wednesday, 17 March 2010

Page 4: 16 Sequences

1. Sequences

2. Limits

3. Chebyshev’s theorem

4. The law of large numbers

5. The central limit theorem

Wednesday, 17 March 2010

Page 5: 16 Sequences

1 variable: X

2 variables: X, Y

...

n variables: X1, X2, X3, ..., Xn

Sequences

Wednesday, 17 March 2010

Page 6: 16 Sequences

SequencesXi ~ Normal(μi, σi)

Xi ~ Normal(μ, σi)

Xi ~ Normal(μi, σ)

Xi ~ Normal(μ, σ)

Almost always assume that the Xi’s are independent. In the last case they are also identically distributed.

Wednesday, 17 March 2010

Page 7: 16 Sequences

iid = independent & identically distributed

Wednesday, 17 March 2010

Page 8: 16 Sequences

Your turn

Xi are iid N(0, 2).

What is E(X30)? What is Var(X2001)?

What is Cor(X10, X11)? Cor(X1, X1000)?

Wednesday, 17 March 2010

Page 9: 16 Sequences

E(n�

i

Xi) =n�

i

E(Xi)

V ar(n�

i

aiXi) =n�

i

a2i V ar(Xi)

If what is true?

E(n�

i

Xi) =n�

i

E(Xi)If what is true?

Wednesday, 17 March 2010

Page 10: 16 Sequences

Limits

Typically will define some function of n random variables, e.g.

What happens to when n → ∞?

Why? Because often it will converge, and we can use this to approximate results for any large n.

X̄n

X̄n

Wednesday, 17 March 2010

Page 11: 16 Sequences

New notation

If xn → 0, and n is big, we can say xn ≈ 0.

If Xn → Z, Z ~ N(0, 1), and n is big, we can say Xn ~ N(0,1).

Read as approximately distributed.

Other ways to write it

.

Wednesday, 17 March 2010

Page 12: 16 Sequences

Chebyshev

P (|X − µ| < Kσ) ≥ 1− 1K2

P (|X − µ| > Kσ) ≤ 1K2

For K > 0

No limit - but a

good starting point

Wednesday, 17 March 2010

Page 13: 16 Sequences

Your turn

How can you put this in words?

P (|X − µ| > Kσ) ≤ 1K2

Wednesday, 17 March 2010

Page 14: 16 Sequences

K

1K2

20

40

60

80

0 2 4 6 8 10

The probability of being more than K standard deviations away from the mean is less than one over K squared.

(For K > 0)

Wednesday, 17 March 2010

Page 15: 16 Sequences

K

1K2

0.0

0.2

0.4

0.6

0.8

1.0

2 4 6 8 10

(For K > 1)

Wednesday, 17 March 2010

Page 16: 16 Sequences

Your turn

How does this compare to the normal distribution? Compare the probability of being less than 1, 2 and 3 standard deviations away from the mean given by Chebychev and what we know about the normal.

Wednesday, 17 March 2010

Page 17: 16 Sequences

x

value

0.0

0.2

0.4

0.6

0.8

1.0

2 4 6 8 10

variablechebynorm

Wednesday, 17 March 2010

Page 18: 16 Sequences

LLNLaw of large numbers

X1, X2, ..., Xn iid.

There are five ways to write the result.

X̄n =n�

i

Xi

Wednesday, 17 March 2010

Page 19: 16 Sequences

What does it mean?

As we collect more and more data, the sample mean gets closer and closer to the true mean.

Not that surprising!

But note that we didn’t make any assumptions about the distributions

Wednesday, 17 March 2010

Page 20: 16 Sequences

CLT

Central limit theorem.

The distribution of a mean is normal when gets big.

Wednesday, 17 March 2010

Page 21: 16 Sequences

Approximation

This implies that if n is big then ...

Wednesday, 17 March 2010

Page 22: 16 Sequences

Reading

Section 4.1

Focus on the general ideas and the defintions

Wednesday, 17 March 2010