Review Flashcards

1
Q

Define E[X] and E[Z|Y] through the tower rule

A

E[X] = E[E[X|Y ]]

E[Z|Y ] = E[E[Z|X]|Y]

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

State Markov’s inequality

A

P( |X| >= t) <= E[ |X| ] / t

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

State Slutsky’s theorem

A

If Xn –d–> X and Yn –p–> c then
Xn + Yn –d–> X + c
XnYn –d–> cX
Xn/Yn –d–> Xn/c

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

What is the continuous mapping theorem?

A

Xn –d–> X implies g(Xn) –d–> g(X)

Xn –P–> X implies g(Xn) –P–> g(X)

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

State the weak law of large numebrs

A

For Xi iid with E|Xi| < inf we have that as n -> inf

mean(Xn) –P–> E[X1]

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

State the central limit theorem

A

as n -> inf

sqrt(n) ( mean(X) - E[X1]) –d–> N(0, var(X))

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

What does it mean that Xn converges to X in distribution? And probability?

A

Distribution: F_{Xn}(x) → F_{X}(x)
Probability:for any E>0, P(|Xn − X| ≥ E) →0 as n → ∞

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