An exact rate of convergence in the functional central limit theorem for special martingale difference arrays (Q3326519)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3858078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact rate of convergence in the functional central limit theorem for special martingale difference arrays |
scientific article; zbMATH DE number 3858078 |
Statements
An exact rate of convergence in the functional central limit theorem for special martingale difference arrays (English)
0 references
1984
0 references
functional limit theorems
0 references
weak convergence of probability measures on function spaces
0 references
rate of convergence
0 references
Skorokhod embedding scheme
0 references
0.8406481146812439
0 references
0.8246229887008667
0 references
A natural way to describe the speed of convergence in weak functional limit theorems is by means of an appropriate metric for the topology of weak convergence of probability measures on function spaces. For the space \(C=C([0,1])\) of all real-valued functions on the unit interval a convenient metric is the one proposed by \textit{Yu. V. Prokhorov}, Teor. Veroyatn. Primen 1, 177-238 (1956; Zbl 0075.290). Within this framework it is shown that under suitable conditions the rate of convergence in the functional central limit theorem for C-valued partial sum processes based on martingale difference arrays is the same as in the special case of row-wise independent random variables where this rate is known to be an optimal one. The proof relies upon the martingale version of the Skorokhod embedding scheme.
0 references