From the Strong Law of Large Numbers to the Law of Iterated Logarithm

1992 ◽  
Vol 45 (3) ◽  
pp. 479-482 ◽  
Author(s):  
Tien-Chung Hu ◽  
N.C. Weber

For sequences of independent and identically distributed random variables it is well known that the existence of the second moment implies the law of the iterated logarithm. We show that the law of the iterated logarithm does not extend to arrays of independent and identically distributed random variables and we develop an analogous rate result for such arrays under finite fourth moments.


1983 ◽  
Vol 35 (6) ◽  
pp. 1129-1146 ◽  
Author(s):  
G. L. O'Brien

Let {Yn, n ∊ Z} be an ergodic strictly stationary sequence of random variables with mean zero, where Z denotes the set of integers. For n ∊ N = {1, 2, …}, let Sn = Y1 + Y2 + … + Yn. The ergodic theorem, alias the strong law of large numbers, says that n–lSn → 0 as n → ∞ a.s. If the Yn's are independent and have variance one, the law of the iterated logarithm tells us that this convergence takes place at the rate in the sense that1It is our purpose here to investigate what other rates of convergence are possible for the ergodic theorem, that is to say, what sequences {bn, n ≧ 1} have the property that2for some ergodic stationary sequence {Yn, n ∊ Z}.


Author(s):  
Li Guan ◽  
Jinping Zhang ◽  
Jieming Zhou

This work proposes the concept of uncorrelation for fuzzy random variables, which is weaker than independence. For the sequence of uncorrelated fuzzy variables, weak and strong law of large numbers are studied under the uniform Hausdorff metric d H ∞ . The results generalize the law of large numbers for independent fuzzy random variables.


2017 ◽  
Vol 96 (2) ◽  
pp. 333-344
Author(s):  
ALLAN GUT ◽  
ULRICH STADTMÜLLER

The present paper is devoted to complete convergence and the strong law of large numbers under moment conditions near those of the law of the single logarithm (LSL) for independent and identically distributed arrays. More precisely, we investigate limit theorems under moment conditions which are stronger than $2p$ for any $p<2$, in which case we know that there is almost sure convergence to 0, and weaker than $E\,X^{4}/(\log ^{+}|X|)^{2}<\infty$, in which case the LSL holds.


1974 ◽  
Vol 11 (3) ◽  
pp. 582-587 ◽  
Author(s):  
G. L. O'Brien

Chain-dependent processes, also called sequences of random variables defined on a Markov chain, are shown to satisfy the strong law of large numbers. A central limit theorem and a law of the iterated logarithm are given for the case when the underlying Markov chain satisfies Doeblin's hypothesis. The proofs are obtained by showing independence of the initial distribution of the chain and by then restricting attention to the stationary case.


Sign in / Sign up

Export Citation Format

Share Document