06.03.2017 Views

Mathematics for Computer Science

e9ck2Ar

e9ck2Ar

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

“mcs” — 2017/3/3 — 11:21 — page 902 — #910<br />

902<br />

Chapter 20<br />

Deviation from the Mean<br />

(c) Given this setup (and assuming mutual independence between the loans), what<br />

is the expected failure rate in the mezzanine tranche?<br />

(d) We take the mezzanine tranches from 100 bonds and create a CDO. What is<br />

the expected number of underlying failures to hit the CDO?<br />

(e) We divide this CDO into 10 tranches of 1000 bonds each. Assuming mutual<br />

independence, give an upper bound on the probability of one or more failures in the<br />

best tranche. The third tranche?<br />

(f) Repeat the previous question without the assumption of mutual independence.<br />

Homework Problems<br />

Problem 20.34.<br />

We have two coins: one is a fair coin, but the other produces heads with probability<br />

3=4. One of the two coins is picked, and this coin is tossed n times. Use the<br />

Chernoff Bound to determine the smallest n which allows determination of which<br />

coin was picked with 95% confidence.<br />

Problem 20.35.<br />

An infinite version of Murphy’s Law is that if an infinite number of mutually independent<br />

events are expected to happen, then the probability that only finitely many<br />

happen is 0. This is known as the first Borel-Cantelli Lemma.<br />

(a) Let A 0 ; A 1 ; : : : be any infinite sequence of mutually independent events such<br />

that<br />

X<br />

PrŒA n D 1: (20.29)<br />

Prove that PrŒno A n occurs D 0.<br />

n2N<br />

Hint: B k the event that no A n with n k occurs. So the event that no A n occurs is<br />

B WWD \ k2N<br />

B k :<br />

Apply Murphy’s Law, Theorem 20.6.4, to B k .<br />

(b) Conclude that PrŒonly finitely many A n ’s occur D 0.<br />

Hint: Let C k be the event that no A n with n k occurs. So the event that only<br />

finitely many A n ’s occur is<br />

C WWD [ k2N<br />

C k :

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

Saved successfully!

Ooh no, something went wrong!