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.
Let
U1,U2,\ldots
FU,n(t)=
1 | |
n |
n | |
\sum | |
i=1 |
1 | |
Ui\leqt |
, t\in[0,1].
\alphaU,n(t)=\sqrt{n}(FU,n(t)-t), t\in[0,1].
\alphaU,n(t)
B(t).
Theorem (KMT, 1975) On a suitable probability space for independent uniform (0,1) r.v.
U1,U2\ldots
\{\alphaU,n(t),0\leqt\leq1\}
\{Bn(t),0\leqt\leq1\}
P\left\{\sup0\leq|\alphaU,n
(t)-B | ||||
|
for all positive integers n and all
x>0
A corollary of that theorem is that for any real iid r.v.
X1,X2,\ldots,
F(t),
\alphaX,n(t)=\sqrt{n}(FX,n(t)-F(t))
GF,n(t)=Bn(F(t))
\limsupn\toinfty
\sqrt{n | |