Lably
Skip to content

Empirical measure

Random measure in probability theory

  • 2 min read
  • 2 chapters

Related on Lably

Through Random variable, Empirical probability and Independence (probability theory)

The motivation for studying empirical measures is that it is often impossible to know the true underlying probability measure P. We collect observations X1,X2,…,Xn and compute relative frequencies. We can estimate P, or a related distribution function F by means of the empirical measure or empirical distribution function, respectively. These are uniformly good estimates under certain conditions. Theorems in the area of empirical processes provide rates of this convergence.

Definition

Let X1,X2,… be a sequence of independent identically distributed random variables with values in the state space S with probability distribution P.

Definition

The empirical measure Pn is defined for measurable subsets of S and given by
Pn(A)=1n∑i=1nIA(Xi)=1n∑i=1nδXi(A)
where IA is the indicator function and δX is the Dirac measure.

Properties

  • For a fixed measurable set A, nPn(A) is a binomial random variable with mean nP(A) and variance nP(A)(1 − P(A)).
  • For a fixed partition Ai of S, random variables Yi=nPn(Ai) form a multinomial distribution with event probabilities P(Ai)
    • The covariance matrix of this multinomial distribution is Cov(Yi,Yj)=nP(Ai)(δij−P(Aj)).

Definition

(Pn(c))c∈C is the empirical measure indexed by C, a collection of measurable subsets of S.

To generalize this notion further, observe that the empirical measure Pn maps measurable functions f:S→R to their empirical mean,

f↦Pnf=∫SfdPn=1n∑i=1nf(Xi)

In particular, the empirical measure of A is simply the empirical mean of the indicator function, Pn(A) = Pn IA.

For a fixed measurable function f, Pnf is a random variable with mean Ef and variance 1nE(f−Ef)2.

By the strong law of large numbers, Pn(A) converges to P(A) almost surely for fixed A. Similarly Pnf converges to Ef almost surely for a fixed measurable function f. The problem of uniform convergence of Pn to P was open until Vapnik and Chervonenkis solved it in 1968.

If the class C (or F) is Glivenko–Cantelli with respect to P then Pn converges to P uniformly over c∈C (or f∈F). In other words, with probability 1 we have

‖Pn−P‖C=supc∈C|Pn(c)−P(c)|→0,
‖Pn−P‖F=supf∈F|Pnf−Ef|→0.

Sign in to keep reading

One more chapter is free with a Lably account.

More in Statistics