A law of the iterated logarithm for random geometric series (Q2365742): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 17:52, 2 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A law of the iterated logarithm for random geometric series |
scientific article |
Statements
A law of the iterated logarithm for random geometric series (English)
0 references
29 June 1993
0 references
For i.i.d. random variables \(\varepsilon_ i\) with mean zero and variance 1 let \(\xi(\beta)=\sum^ \infty_{n=0}\beta^ n\varepsilon_ n\), \(\beta<1\). In an earlier paper [Limit theorems for Bernoulli convolutions. To appear in: Dynamical systems and frustrated system (ed. by S. Martinez and C. Burgaño)] the authors proved that \[ \lim\sup(1- \beta^ 2)^{1/2}(2\log\log(1/(1-\beta^ 2))^{-1}\xi(\beta)=\lim\sup \overline\xi(\beta)=1\text{ a.s. } \] as \(\beta\uparrow 1\) for symmetric Bernoulli r.v. \(\varepsilon_ i\). The present paper generalizes this result essentially. First the \(\varepsilon_ i\) are now only assumed to have mean zero and variance 1. Secondly the set \(C(\{\overline\xi(\beta)\})\) of all accumulation points is considered instead of \(\lim\sup\). The main result says that \(P(\lim\text{dist}(\overline\xi(\beta),[-1,1])=0)=1\) and \(P(C(\{\overline\xi(\beta)\})=[-1,1])=1\), where \(\text{dist}(a,b)\) is the distance between \(a\) and \(b\).
0 references
law of iterated logarithm
0 references
Hartman-Winter condition
0 references
accumulation points
0 references