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.

3.4. EXPECTED VALUE 41<br />

• For random variables X and Y—not necessarily independent—and constants a and b, we have<br />

E(aX + bY ) = aEX + bEY (3.15)<br />

This follows by taking U = aX and V = bY in (3.13), and then using (3.15).<br />

• For any constant b, we have<br />

E(b) = b (3.16)<br />

For instance, say U is temperature in Celsius. Then the temperature in Fahrenheit is W = 9<br />

5U +32.<br />

So, W is a new random variable, and we can get its expected value from that <strong>of</strong> U by using (3.15)<br />

and b = 32.<br />

with a = 9<br />

5<br />

Another important point:<br />

Property D: If U and V are independent, then<br />

E(UV ) = EU · EV (3.17)<br />

In the dice example, for instance, let D denote the product <strong>of</strong> the numbers <strong>of</strong> blue dots and yellow<br />

dots, i.e. D = XY. Then<br />

E(D) = 3.5 2 = 12.25 (3.18)<br />

Equation (3.17) doesn’t have an easy “notebook pro<strong>of</strong>.” It is proved in Section 8.3.1.<br />

Consider a function g() <strong>of</strong> one variable, and let W = g(X). W is then a random variable <strong>to</strong>o. Say<br />

X takes on values in A, as in (3.7). Then W takes on values in B = {g(c) : cɛA}. Define<br />

Then<br />

so<br />

Ad = {c : c ∈ A, g(c) = d} (3.19)<br />

P (W = d) = P (X ∈ Ad) (3.20)

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

Saved successfully!

Ooh no, something went wrong!