Академический Документы
Профессиональный Документы
Культура Документы
P ( a X b) P (X A)
=
a
fX (x)dx fX (x)dx
A
fX (x)dx = 1
3 2 PDF Interpretation
E [X ] = Caution: fX (x) = P (X = x) if X is continuous, P (X = x) = 0 x!! fX (x) can be 1 Interpretation: probability per unit length for small lengths around x P (x X x + ) fX (x) Var(X ) = = = E [g (X )] = E [aX + b] Var(aX + b) = =
xfX (x)dx
2
E (X E [X ])
(x E [X ])2 fX (x)dx
E [X 2 ] (E [X ])2 ( 0)
g (x)fX (x)dx
aE [X ] + b a2 Var(X )
Denition: monotonically increasing from 0 (at ) to 1 (at +). Continuous RV (CDF is continuous in x): FX (x) = P (X x) = fX (x) =
x
x a ba
p X (k )
pX (k ) = FX (k ) FX (k 1)
5
ba 2 ( b a) 2 var(X ) = 12 E [X ] =
6
X is an exponential random variable with parameter : ex if x 0 fX (x) = 0 otherwise 1 ex if x 0 FX (x) = 0 otherwise 1 1 E [X ] = var(X ) = 2 Memoryless Property: Given that X > t, X t is an exponential RV with parameter
E [X ] =
Standard Normal RV: N (0, 1) CDF of standard normal RV Y at y: (y ) - given in tables for y 0 - for y < 0, use the result: (y ) = 1 (y ) To evaluate CDF of a general standard normal, express it as a function of a standard normal: X N (, 2 ) P (X x) = P X N (0, 1)
x x X =
Marginal pdf: fX (x) = fX,Y (x, y )dy E [g (X, Y )] = g (x, y )fX,Y (x, y )dxdy Joint CDF: FX,Y (x, y ) = P (X x, Y y )
10
11 10 Independence
Conditioning on an event
By denition, X, Y independent fX,Y (x, y ) = fX (x)fY (y ) (x, y ) If X and Y are independent: E [XY ]=E [X ]E [Y ] g (X ) and h(Y ) are independent E [g (X )h(Y )] = E [g (X )]E [h(Y )] E [g (X )|A] = P (X B |X A) = fX |A (x) =
fX (x) P (X A )
if x A otherwise
E [X |A] =
11
12
12
If A1 , . . . , An are disjoint events that form a partition of the sample space,
n
Conditioning on a RV
fX,Y (x, y ) fY (y )
fX (x)
=
i=1 n
P (Ai )fX |Ai (x) ( total probability theorem) P (Ai )E [X |Ai ] (total expectation theorem)
i=1 n
E [X ] = E [g (X )] =
i=1
P (Ai )E [g (X )|Ai ]
= = =
xfX |Y (x|y )dx g (X )fX |Y (x|y )dx g (x, y )fX |Y (x|y )dx
13
14
13
Total Expectation Theorem:
X, Y continuous RV, N discrete RV, A an event. E [X |Y = y ]fY (y )dy E [g (X )|Y = y ]fY (y )dy P (A|Y = y ) E [g (X, Y )|Y = y ]fY (y )dy = fX |Y (x|y ) =
E [X ] = E [g (X )] = E [g (X, Y )] =
P (A)fY |A (y ) P (A)fY |A (y ) = fY (y ) fY |A (y )P (A) + fY |Ac (y )P (Ac ) pN (n)fY |N (y |n) = fY (y ) pN (n)fY |N (y |n) i pN (i)fY |N (y |i)
P (N = n|Y = y ) =
15
16
14
Derived distributions
15
Convolution
Def: PDF of a function of a RV X with known PDF: Y = g (X ). Method: Get the CDF: F Y (y ) = P (Y y ) = P (g (X ) y ) = Dierentiate: fY (y ) =
dFY dy x| g ( x) y
(y )
1 x b |a| fX ( a )
Special case: if Y = g (X ) = aX + b, fY (y ) =
fW (w) =
fX (x)fY (w x) dx
17
18
Graphical Method: put the PMFs (or PDFs) on top of each other ip the PMF (or PDF) of Y shift the ipped PMF (or PDF) of Y by w cross-multiply and add (or evaluate the integral) In particular, if X, Y are independent and normal, then W = X + Y is normal.
16
E [X |Y = y ] = f (y ) is a number. E [X |Y ] = f (Y ) is a random variable (the expectation is taken with respect to X). To compute E [X |Y ], rst express E [X |Y = y ] as a function of y . Law of iterated expectations: E [X ] = E [E [X |Y ]] (equality between two real numbers)
19
20
17
Var(X |Y ) is a random variable that is a function of Y (the variance is taken with respect to X). To compute Var(X |Y ), rst express Var(X |Y = y ) = E [(X E [X |Y = y ])2 |Y = y ] as a function of y . Law of conditional variances: Var(X ) = E [Var(X |Y )] + Var(E [X |Y ]) (equality between two real numbers)
N discrete RV, Xi i.i.d and independent of N . Y = X1 + . . . + XN . Then: E [Y ] Var(Y ) = = E [X ]E [N ] E [N ]Var(X ) + (E [X ])2 Var(N )
21
22
19
By denition, X, Y are uncorrelated Cov(X, Y ) = 0. If X, Y independent X and Y are uncorrelated. (the converse is not true) In general, Var(X+Y)= Var(X)+ Var(Y)+ 2 Cov(X,Y) If X and Y are uncorrelated, Cov(X,Y)=0 and Var(X+Y)= Var(X)+Var(Y)
23
24