06.06.2013 Views

Theory of Statistics - George Mason University

Theory of Statistics - George Mason University

Theory of Statistics - George Mason University

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.

132 1 Probability <strong>Theory</strong><br />

Example 1.34 likelihood ratios<br />

Let f and g be probability densities. Let X1, X2, . . . be an iid sequence <strong>of</strong><br />

random variables whose range is within the intersection <strong>of</strong> the domains <strong>of</strong> f<br />

and g. Let<br />

n<br />

Yn = g(Xi)/f(Xi). (1.278)<br />

i=1<br />

(This is called a “likelihood ratio” and has applications in statistics. Note<br />

that f(x) and g(x) are likelihoods, as defined in equation (1.18) on page 20,<br />

although the “parameters” are the functions themselves.) Now suppose that<br />

f is the PDF <strong>of</strong> the Xi. Then {Yn : n = 1, 2, 3, . ..} is a martingale with<br />

respect to {Xn : n = 1, 2, 3, . ..}.<br />

The martingale in Example 1.34 has some remarkable properties. Robbins<br />

(1970) showed that for any ɛ > 1,<br />

Pr(Yn ≥ ɛ for some n ≥ 1) ≤ 1/ɛ. (1.279)<br />

Robbins’s pro<strong>of</strong> <strong>of</strong> (1.279) is straightforward. Let N be the first n ≥ 1 such<br />

that n i=1 g(Xi) ≥ ɛ n i=1 f(Xi), with N = ∞ if no such n occurs. Also, let<br />

gn(t) = n i=1 g(ti) and fn(t) = n i=1 f(ti).<br />

Pr(Yn ≥ ɛ for some n ≥ 1) = Pr(N < ∞)<br />

∞<br />

<br />

= I{n}(N)fn(t)dt<br />

i=1<br />

≤ 1<br />

ɛ<br />

≤ 1<br />

ɛ .<br />

∞<br />

<br />

I{n}(N)gn(t)dt<br />

Another important property <strong>of</strong> the martingale in Example 1.34 is<br />

Yn<br />

You are asked to show this in Exercise 1.83.<br />

i=1<br />

a.s.<br />

→ 0. (1.280)<br />

Example 1.35 Wiener process<br />

If {W(t) : t ∈ [0, ∞[} is a Wiener process, then W 2 (t) − t is a martingale.<br />

(Exercise.)<br />

Example 1.36 A martingale that is not Markovian and a Markov<br />

process that is not a martingale<br />

The Markov property is based on conditional independence <strong>of</strong> distributions<br />

and the martingale property is based on equality <strong>of</strong> expectations. Thus it is<br />

easy to construct a martingale that is not a Markov chain beginning with<br />

<strong>Theory</strong> <strong>of</strong> <strong>Statistics</strong> c○2000–2013 James E. Gentle

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

Saved successfully!

Ooh no, something went wrong!