Skip to main content
2 of 2
replaced http://mathoverflow.net/ with https://mathoverflow.net/

Estimating the variance of error in empirical approximation to a distribution

Let $X_1,X_2,\ldots,X_n$ be i.i.d. random variables in $\mathbb{R}$ with common cumulative distribution function (CDF) $F(x)$. The empirical approximation to $F(x)$ is defined as follows:

$$\hat{F}_n(x)=\frac{1}{n}\sum_{i=1}^n\mathbf{1}_{\{X_i\leq x\}}(x)\tag{1}$$

where $\mathbf{1}_A(x)$ is an indicator function: unity when $x\in A$ and zero otherwise.

Per an answer to my previous question, by Donsker's Theorem the scaled error process $G_n(x)\equiv\sqrt{n}\left(\hat{F}_n(x)-F(x)\right)$ converges to the Brownian bridge process $B(F(x))$.

I am interested in the error of a point estimate $\hat{F}_n(x_0)$. The first sentence of the "History" section of the Wikipedia article on the Donsker's Theorem states the following:

By the classical central limit theorem, for fixed $x$, the random variable $G_n(x)$ converges in distribution to a Gaussian (normal) random variable $G(x)$ with zero mean and variance $F(x)(1 − F(x))$ as the sample size $n$ grows.

I have two questions about this statement (in order of importance):

  1. What is the standard approach when $F(x)$ is unknown? Can one use the estimate $\hat{F}_n(x)$? (similarly to how we use the sample variance estimator to approximate the confidence interval for unknown mean given unknown variance)

  2. While I am familiar with the standard proofs and the use of the classical CLT, I don't see how one proves the statement above using standard CLT. Can someone provide a hint?

Bullmoose
  • 907
  • 6
  • 16