A law of the iterated logarithm for double array sum of \(\varphi\)-mixing sequence (Q1179953)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A law of the iterated logarithm for double array sum of \(\varphi\)-mixing sequence |
scientific article; zbMATH DE number 26788
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A law of the iterated logarithm for double array sum of \(\varphi\)-mixing sequence |
scientific article; zbMATH DE number 26788 |
Statements
A law of the iterated logarithm for double array sum of \(\varphi\)-mixing sequence (English)
0 references
27 June 1992
0 references
Let \(\{\varepsilon_ i\}\) be a bounded \(\varphi\)-mixing sequence and \(\{a_{ni}\}\) a double array of constants. By using Bernstein ad Utev's inequality the author shows \[ \limsup_ n|\sum^ n_{i=1}a_{ni}\varepsilon_ i|/(A_ n\log\log A_ n)^{1/2}\leq b<\infty \hbox{ a.s.}, \] where \(A_ n=\sum^ n_{i=1}a^ 2_{ni}\), and \(b\) is some constant, under certain conditions on \(\{\varepsilon_ i\}\) and \(\{a_{ni}\}\). From this result one can get the most powerful convergence rate of \(LS\) estimates in linear models.
0 references
phi-mixing sequence
0 references
double array sums
0 references
law of the iterated logarithm
0 references
Bernstein and Utev's inequality
0 references
most powerful convergence rate of LS estimates
0 references
linear models
0 references