Loading AI tools
From Wikipedia, the free encyclopedia
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 be independent uniform (0,1) random variables. Define a uniform empirical distribution function as
Define a uniform empirical process as
The Donsker theorem (1952) shows that converges in law to a Brownian bridge Komlós, Major and Tusnády established a sharp bound for the speed of this weak convergence.
A corollary of that theorem is that for any real iid r.v. with cdf it is possible to construct a probability space where independent[clarification needed] sequences of empirical processes and Gaussian processes exist such that
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (November 2010) |
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.