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.

1.3 Sequences <strong>of</strong> Events and <strong>of</strong> Random Variables 97<br />

Properties <strong>of</strong> quantiles, <strong>of</strong> course, are different for discrete and continuous<br />

distributions. In the following, for 0 < π < 1 we will assume that F(xπ)<br />

is twice differentiable in some neighborhood <strong>of</strong> xπ and F ′′ is bounded and<br />

F ′ (xπ) > 0 in that neighborhood. Denote F ′ (x) as f(x), and let Fn(x) =<br />

#{X1, . . ., Xn}/n. Now, write the k th order statistic as<br />

X(k:n) = xπ − Fn(xπ) − π<br />

f(xπ)<br />

+ Rn(π). (1.200)<br />

This is called the Bahadur representation, after Bahadur (1966), who showed<br />

that Rn(π) → 0 as n → ∞. Kiefer (1967) determined the exact order <strong>of</strong> Rn(π),<br />

so equation (1.200) is sometimes called the Bahadur-Kiefer representation.<br />

The Bahadur representation is useful in studying asymptotic properties <strong>of</strong><br />

central order statistics.<br />

There is some indeterminacy in relating order statistics to quantiles. In<br />

the Bahadur representation, for example, the details are slightly different if<br />

nπ happens to be an integer. (The results are the same, however.) Consider<br />

a slightly different formulation for a set <strong>of</strong> m order statistics. The following<br />

result is due to Ghosh (1971).<br />

Theorem 1.48<br />

Let X1, . . ., Xn be iid random variables with PDF f. For k = n1, . . ., nm ≤ n,<br />

let λk ∈]0, 1[ be such that nk = ⌈nλk⌉+1. Now suppose 0 < λ1 < · · · < λm < 1<br />

and for each k, f(xλk) > 0. Then the asymptotic distribution <strong>of</strong> the random<br />

m-vector <br />

n 1/2 (X(n1:n) − xλ1), . . ., n 1/2 <br />

(X(nm:n) − xλm)<br />

is m-variate normal with mean <strong>of</strong> 0, and covariance matrix whose i, j element<br />

is <br />

λi(1 − λj)<br />

.<br />

f(xλi)f(xλj)<br />

For a pro<strong>of</strong> <strong>of</strong> this theorem, see David and Nagaraja (2003).<br />

A sequence <strong>of</strong> extreme order statistics {X(k:n)} is one such that k/n → 0 or<br />

k/n → 1 as n → ∞. Sequences <strong>of</strong> extreme order statistics from a distribution<br />

with bounded support generally converge to a degenerate distribution, while<br />

those from a distribution with unbounded support do not have a meaningful<br />

distribution unless the sequence is normalized in some way. We will consider<br />

asymptotic distributions <strong>of</strong> extreme order statistics in Section 1.4.3.<br />

We now consider some examples <strong>of</strong> sequences <strong>of</strong> order statistics. In Examples<br />

1.27 and 1.28 below, we obtain degenerate distributions unless we<br />

introduce a normalizing factor. In Example 1.29, it is necessary to introduce<br />

a sequence <strong>of</strong> constant shifts.<br />

Example 1.27 asymptotic distribution <strong>of</strong> min or max order statistics<br />

from U(0, 1)<br />

Suppose X1, . . ., Xn are iid U(0, 1). The CDFs <strong>of</strong> the min and max, X(1:n)<br />

and X(n:n), are easy to work out. For x ∈ [0, 1],<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!