Komlós–Major–Tusnády approximation explained

In probability theory, the Komlós–Major–Tusnády approximation (also known as the KMT approximation, the KMT embedding, or the Hungarian embedding) refers to one of the two strong embedding theorems: 1) approximation of random walk by a standard Brownian motion constructed on the same probability space, and 2) an approximation of the empirical process by a Brownian bridge constructed on the same probability space. It is named after Hungarian mathematicians János Komlós, Gábor Tusnády, and Péter Major, who proved it in 1975.

Theory

Let

U1,U2,\ldots

be independent uniform (0,1) random variables. Define a uniform empirical distribution function as

FU,n(t)=

1
n
n
\sum
i=1
1
Ui\leqt

,t\in[0,1].

Define a uniform empirical process as

\alphaU,n(t)=\sqrt{n}(FU,n(t)-t),t\in[0,1].

The Donsker theorem (1952) shows that

\alphaU,n(t)

converges in law to a Brownian bridge

B(t).

Komlós, Major and Tusnády established a sharp bound for the speed of this weak convergence.

Theorem (KMT, 1975) On a suitable probability space for independent uniform (0,1) r.v.

U1,U2\ldots

the empirical process

\{\alphaU,n(t),0\leqt\leq1\}

can be approximated by a sequence of Brownian bridges

\{Bn(t),0\leqt\leq1\}

such that

P\left\{\sup0\leq|\alphaU,n

(t)-B
n(t)|>1
\sqrt{n
}(a\log n+x)\right\}\leq b e^

for all positive integers n and all

x>0

, where a, b, and c are positive constants.

Corollary

A corollary of that theorem is that for any real iid r.v.

X1,X2,\ldots,

with cdf

F(t),

it is possible to construct a probability space where independent sequences of empirical processes

\alphaX,n(t)=\sqrt{n}(FX,n(t)-F(t))

and Gaussian processes

GF,n(t)=Bn(F(t))

exist such that

\limsupn\toinfty

\sqrt{n
} \big\| \alpha_ - G_ \big\|_\infty < \infty,     almost surely.

References