20.03.2013 Views

From Algorithms to Z-Scores - matloff - University of California, Davis

From Algorithms to Z-Scores - matloff - University of California, Davis

From Algorithms to Z-Scores - matloff - University of California, Davis

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

19.4. TRANSFORM METHODS 387<br />

19.4.2 Moment Generating Functions<br />

The generating function is handy, but it is limited <strong>to</strong> discrete random variables. More generally,<br />

we can use the moment generating function, defined for any random variable X as<br />

for any t for which the expected value exists.<br />

mX(t) = E[e tX ] (19.56)<br />

That last restriction is anathema <strong>to</strong> mathematicians, so they use the characteristic function,<br />

φX(t) = E[e itX ] (19.57)<br />

which exists for any t. However, it makes use <strong>of</strong> pesky complex numbers, so we’ll stay clear <strong>of</strong> it<br />

here.<br />

Differentiating (19.56) with respect <strong>to</strong> t, we have<br />

We see then that<br />

m ′ X(t) = E[Xe tX ] (19.58)<br />

m ′ X(0) = EX (19.59)<br />

So, if we just know the moment-generating function <strong>of</strong> X, we can obtain EX from it. Also,<br />

so<br />

m ′′ X(t) = E(X 2 e tX ) (19.60)<br />

m ′′ X(0) = E(X 2 ) (19.61)<br />

In this manner, we can for various k obtain E(X k ), the kth moment <strong>of</strong> X, hence the name.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!