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

Create successful ePaper yourself

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

402 5 Unbiased Point Estimation<br />

5.2.2 Kernels and U-<strong>Statistics</strong><br />

Now consider the estimation <strong>of</strong> the expectation functional Θ(P) in equation<br />

(5.32), given a random sample X1, . . ., Xn, where n ≥ m.<br />

Clearly h(X1, . . ., Xm) is an unbiased estimator <strong>of</strong> θ = Θ(P), and so is<br />

h(Xi1, . . ., Xim) for any m-tuple, 1 ≤ i1 < · · · < im ≤ n; hence, we have that<br />

U = 1<br />

n<br />

<br />

h(Xi1, . . ., Xim) (5.35)<br />

m all combinations<br />

is unbiased for θ.<br />

A statistic <strong>of</strong> this form is called a U-statistic. The U-statistic is a function<br />

<strong>of</strong> all n items in the sample. The function h, which is called the kernel <strong>of</strong> the<br />

U-statistic is a function <strong>of</strong> m arguments. We also refer to the order <strong>of</strong> the<br />

kernel as the order <strong>of</strong> the U-statistic.<br />

Examples<br />

Example 5.15 rth raw moment: M ′ r(P) = E(Xr )<br />

In the simplest U-statistic for r = 1, the kernel is <strong>of</strong> order 1 and h is the<br />

identity, h(x) = x. This is just the sample mean. More generally, we have the<br />

, yielding the first order<br />

r th raw population moment by defining hr(xi) = x r i<br />

U-statistic<br />

U(X1, . . ., Xn) = 1<br />

n<br />

n<br />

i=1<br />

X r i ,<br />

which is the r th sample moment.<br />

(The notation hr will be used differently below.***)<br />

Example 5.16 r th power <strong>of</strong> the mean: (E(X)) r<br />

Another simple U-statistic with expectation (E(X)) r where the r th order kernel<br />

is h(x1, . . ., xr) = x1 · · ·xr. The U-statistic<br />

n<br />

r<br />

U(X1, . . ., Xn) = 1<br />

<br />

has expectation (E(X)) r .<br />

<br />

all combinations<br />

Xi1 · · ·Xir<br />

Example 5.17 Pr(X ≤ a): Θ(P) = E I]∞,a](X) = P(a)<br />

Compare this with the quantile functional in equation (5.31), which cannot<br />

be expressed as an expectation functional. The quantile problem is related to<br />

an inverse problem in which the property <strong>of</strong> interest is the π; that is, given a<br />

value a, estimate P(a). We can write an expectation functional and arrive at<br />

the U-statistic<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!