Académique Documents
Professionnel Documents
Culture Documents
1. INTRODUCTION
According to Hsu and Robbins [9], a sequence of real-valued random variables
{Xn , n 1} converges completely to 0 if,
(1.1)
P |Xn | > < for all > 0.
n=1
Based on this definition, Hsu and Robbins [9] and Erd o s [7] derived a necessary
and sufficient condition for a sequence of independent identically distributed (i.i.d.)
random variables {Xn , n 1}. The assertion is: EX 1 = 0 and E|X1 |2 < if
and only if
n
P
Xi > n < for all > 0.
(1.2)
n=1
i=1
1759
1760
Their theorem was extended by Baum and Katz [4] to establish a rate of convergence
in the sense of Marcinkiewicz-Zygmunds strong law of large numbers, which reads:
Let > 1/2, p 1, and {Xn , n 1} be a sequence of i.i.d. random variables.
Then EX1 = 0 and E|X1 |p < if and only if
n
np2 P
Xi > n < for all > 0.
(1.3)
n=1
i=1
The results have been generalized and extended in several directions. A host of
researchers considered the problem in a Banach space setting; see Ahmed et al. [3],
Hu et al. [11], Sung [21], Hern a ndez et al. [8], Sung et al. [19, 22], and Wang
[25] among others.
Recall that a sequence of random elements {Vni , n 1, 1 i n} is stochastically dominated by a random element V if for some constant C < ,
(1.4)
n
P
Xni > n1/t < for all > 0.
(1.5)
n=1
i=1
k
Vni > n 0 as n for all > 0,
max P
kn
i=1
then
(1.7)
n=1
n
np2P
Vni > n < for all > 0.
i=1
Later, Sung established a complete convergence for weighted sums of random elements in [20]. Let {V ni , n 1, 1 i n} be an array of row-wise independent
random elements that is stochastically dominated by a random element V . Let p 1
and {bni, n 1, 1 i n} be an array of constants satisfying
1761
(1.8)
1in
and
n
(1.9)
i=1
2p
If EV
1
.
b2ni = o
log n
< and
n
(1.10)
i=1
then
(1.11)
n
P
bni Vni > < for all > 0.
n=1
i=1
n
i=1
If
(1.13)
n
1
n1/p
ani Vi 0 in probability,
i=1
then
(1.14)
n
1
n1/p
ani Vi 0 a.s.
i=1
In this paper, we obtain the almost sure convergence and complete convergence
for randomly weighted sums of arrays of row-wise independent random elements.
Although Cuzick [5], Li and Tomkins [18] and Li et al. [17] also considered almost
sure convergence with random weights, to the best of our knowledge, there has yet
been any result on the complete convergence of the case in which the weights are
random variables. Moreover, the results in the aforementioned papers do not imply
our results even in the case the weights are non-random. Most of the results of the
aforementioned work in the literature can be covered and improved by our results.
1762
consisting of
square
The above algorithm is stochastic approximation type analogs to its finite dimen n (t) K(t), and use K
n , K
n , K,
n (t) = K
sional counterpart [14]. Define K
n (t), K(t),
K
and zn denote the random variables whose point values are K(t),
and zn (n t), resp.
n (t) + n zn [ K
n , zn + n ].
n+1 (t) = K
(1.16)
K
In the implementation, one often wishes to use a projection algorithm
n (t) + n zn [ K
n , zn + n ] ,
n+1 (t) = K
(1.17)
K
where () is the projection to the unit ball in L 2 [0, 1]. As explained in [13, p.
782], this can be further rewritten as
n (t) + n zn [ K
n , zn + n ] n cn K
n + On ,
n+1 (t) = K
(1.18)
K
m(T )
where cn satisfies n cn < 1, and On satisfies j=0 Oj 0, for any 0 < T <
with m(t) = max{n : tn t} and tn = n1
j=0 j . In analyzing such algorithms,
one often needs to deal with a term (see [13, p. 783])
n
n
k=0
j=k+1
k + k ).
(1 j cj ) k zk ( zk , K
1763
As can be seen that this term is of the form a weighted sum of random variables.
Our work in this paper provides a sufficient condition for almost sure convergence
and complete convergence of such a sequence.
We also note that many linear models in statistics based on a random sample involve weighted sums of dependent random variables. Examples include least-squares
estimators, nonparametric regression function estimators, and jackknife estimates,
among others. In this respect, the study of convergence for these weighted sums
has impact on statistics, probability, and their applications.
The rest of the paper is arranged as follows. Section 2 presents some definitions
and lemmas to be used in the proof of our results. Section 3 provided conditions for
almost sure convergence for randomly weighted sums. Our results in this section
improve the results by Li et al. [16]. Section 4 establishes complete convergence
for randomly weighted sums of arrays of row-wise independent random elements in
a real separable Banach space. In the main results, Theorem 3.1, Theorem 3.3, and
Theorem 4.1, no assumptions are made concerning the geometry of the underlying
Banach space. Finally, in Section 5, some corollaries and examples are presented
to illustrate the results. It demonstrates that our conditions are sharp and our results
lead to better convergence rates. Throughout this paper, the symbol C denotes a
generic positive constant (0 < C < ) whose values may be different for different
appearances.
2. PRELIMINARIES
We begin with definitions, notation, and preliminary results prior to establishing
the main results. Let X be a real separable Banach space with norm ||||. A random
element in X will be denoted by V or by Vn , Wn , etc.
The expected value or mean of a random element V , denoted EV , is defined
to be the Pettis integral provided it exists. That is, V has expected value EV X
if h(EV ) = E(h(V )) for every h X , where X denotes the (dual) space of all
continuous linear functionals on X . If E||V || < , then (see, e.g., Taylor [23, p.
40]) V has an expected value. But the expected value can exist when E||V || = .
For an example, see Taylor [23, p. 41].
Lemma 2.1 below is a Marcinkiewicz type inequality for some of independent
random elements; see de Acosta [1] for a proof.
Lemma 2.1. Let {Vni , n 1, 1 i n} be an array of row-wise independent
random elements. Then for every r 1, there is a positive constant C r depending
only on r such that for all n 1,
(2.19)
n
n
n
r
Vni E
Vni Cr
EVnir , for 1 r 2,
E
i=1
i=1
i=1
1764
and
n
n
r
Vni E
Vni
E
i=1
(2.20)
Cr
n
i=1
EVni
2 r/2
i=1
n
EVnir , for r > 2.
i=1
The following lemma is a Banach space version of Lemma 2.1 of Li at al. [16].
The proof is similar to that of Lemma 2.2 in Hu at al. [11].
Lemma 2.2. Let r 1, and {Vn, n 1} be a sequence of random elements
and {Vn , n 1} an independent copy of {V n , n 1}. If Vn 0 in probability,
then
nr2 P {Vn } < for every > 0 if and only if
nr2 P {Vn
(ii)
n=1
n=1
The third lemma due to Hu at al. [11] concerning the relationship between
convergence in probability and mean convergence for sums of independent bounded
random elements.
Lemma 2.3. Let {Vni , n 1, 1 i n} be an array of row-wise independent
symmetric random elements and suppose
n there exists > 0 such that V ni
a.s.
for
all
n
1,
1
n.
If
i=1 Vni 0 in probability as n , then
n
E
i=1 Vni 0 as n .
The following lemma is a result of Adler at al. [2] concerning the expectation
of the truncation random elements that are stochastically dominated by a random
element V .
Lemma 2.4. Let {Vni , n 1, 1 i n} be an array of random elements that
is stochastically dominated by a random element V . Then for all p > 0
E Vni pI(Vni t)
(2.21)
Ctp P (V > t)+CE V pI(V t) , t 0, n 1, 1 i n,
and
(2.22)
E Vni I(Vni > t)
CE V I(V > t) , t 0, n 1, 1 i n.
1765
i=1
i=1
i=1
i=1
(3.1)
n1,1in
(3.2)
1
n1/p
E
n
i=1
(3.3)
then
i=1
1766
lim
(3.4)
n
1
n1/p
(2) If 1 p 2 and
n
(3.5)
Ani Vi = 0 a.s.
i=1
i=1
1in
(3.6)
and
),
N
).
N
n
i=1
(3.7)
n
Ani Xni )
(by the Markov inequality)
exp(tn1/p )E exp(t
i=1
exp(tn1/p )
n
n
2
Ani Xni + 2t
EAniXni 2 exp(2tn1/p log1 n) .
exp tE
i=1
i=1
Since EV < , p > 2, we have from (3.1) and (3.3) that
(3.8)
n
i=1
EAniXni C
n
i=1
1767
2n1/p log n
Putting t =
, it follows from (3.2), (3.7) and (3.8) that there exists
Therefore
(3.10)
P (
n=1
n
i=1
n
i=1
1/p
1
P (there are at least
N such is that A ni Vi > n log n)
P Ani1 Vi1 > n1/p log1 n, . . . ,
1i1 <<iN n
AniN ViN > n1/p log1 n
n
N
P (Ani Vi > n1/p log1 n)
(3.11)
i=1
n
N
EAniVi p
logp n
n
i=1
n
N
E|Ani |2 EVip
logp n
K p2
n
i=1
n
N
2
E|Ani |
logp n
C
n
i=1
p N
log n
C 12/p .
n
Choose N large enough such that (1 2/p)N > 1, we get from (3.11) that
(3.12)
n=1
P (
n
i=1
n
i=1
i=1
1768
(3.14)
(3.15)
n
EAniXni p n1+2/p logp2 n
i=1
n
E|Ani|p n1+2/p logp2 n
i=1
Cn1+2/p logp2 n.
Therefore (3.9) remains true. The rest of the argument is similar to that of (3.12)
and (3.14).
Proof of part (3). Let g(x) = x 2 (ex 1 x) and
Ui = ViI(Vi i1/p), Wi = Vi Ui .
For all t > 0, by Lemma 2.6 and the first part of (3.6),
n
Ani Ui )
E exp(t
i=1
n
n
2
Ani Ui + 4t
EAniUi 2 g(2tn1/pK/ log n)
exp tE
i=1
i=1
n
Ani Ui + 4t2 g(2tn1/pK/ log n)
exp tE
(3.16)
n
i=1
E|Ani|2 EUipn2/p1
i=1
n
Ani Ui + Ct2 n2/p(K/ log n)2 g(2tn1/pK/ log n)
exp tE
i=1
n
Ani Ui + C exp(2tn1/pK/ log n)
exp tE
i=1
1769
Putting t =
that
(3.18)
3n1/p log n
, it follows from (3.17) and the second part of (3.6)
P (
n
i=1
1
and for all large n.
n2
Therefore
(3.19)
P (
n
n=1
i=1
(3.20)
n
Ani Ui 0 a.s. as n .
i=1
n1/p
n
n
i=1 Wi
Ani Wi
i=1
K
Wi 0 a.s. as n .
n1/p log n i=1
n1/p
n
ani Vi 0 in probability as n .
i=1
1770
(iv) Condition (3.5) is strong, but as we can see in Part (3), when (3.1) is strengthened to max1in |Ani | K/ log n a.s., (3.5) can be removed. According to
a result by Cuzick [5, Corollary 2.1 and Lemma 2.1], Part (3) does not hold
if max1in |Ani | K/ log n a.s. is weakened to (3.1).
The proof of the following theorem is similar to that of Part (1) of Theorem 3.1.
Theorem 3.3. Let p > 2, and {Vi, i 1} be a sequence of independent
random elements that are stochastically dominated by a random element V with
EV p < . Let {Ani , n 1, 1 i n} be an array of row-wise independent
random variables such that (3.1) holds. Assume that for all n 1, the random
variables {A ni , 1 i n} are independent of {V i, i 1}, and (3.2) holds. If
n
E(|Ani|2 ) = O(n2/p log1 n),
(3.23)
i=1
then
lim sup
(3.24)
n
Ani Vi < a.s.
n1/p i=1
4. COMPLETE CONVERGENCE
The following theorem provides conditions for complete convergence of randomly weighted sums of row-wise independent random elements in Banach spaces.
Examples are provided in Section 5 to show that these conditions cannot be dispensed with or weakened. No assumptions are made concerning the geometry of
the underlying Banach space.
Theorem 4.1. Let > 1/2, 1 p < 2, {Vni , n 1, 1 i n} be an array
of row-wise independent random elements that are stochastically dominated by a
random element V with EV p < . Let {Ani , n 1, 1 i n} be an array
of row-wise independent random variables. Assume that for all n 1, the random
variables {A ni , 1 i n} are independent of {V ni , 1 i n}. If
n
E(|Ani|2 ) = O(n),
(4.1)
i=1
and
n
Ani Vni I(Vni n ) = 0,
lim n E
(4.2)
then
(4.3)
n=1
p2
i=1
n
P
Ani Vni > n < for all > 0.
i=1
1771
(4.4)
P
i=1
1in
n
Ani Wni > n .
+P
i=1
np2 P max Vni > n < ,
(4.5)
1in
n=1
and
(4.6)
n
np2 P
Ani Wni > n < .
n=1
i=1
First, we have
n=1
np2 P
np2
n=1
C
(4.7)
=C
=C
n=1
1in
n
P Vni > n
i=1
p1
p1
n=1
i
P (V > n )
P (i < V (i + 1))
i=n
np1 P (i < V (i + 1) )
i=1 n=1
i=1
CEV p < .
This proves (4.5). Note that it follows from (4.2) that for all large n,
n
Ani Vni I(Vni n ) < /2.
(4.8)
n E
i=1
1772
(4.9)
p2
n
n
P
Ani Wni E
Ani Wni > n /2 < .
n=1
i=1
i=1
We have
n=1
4
2
n
n
np2 P
Ani Wni E
Ani Wni > n /2
i=1
i=1
n
n
2
np22 E
Ani Wni E
Ani Wni
n=1
i=1
i=1
2
p22
n
E Ani Wni
C
=C
C
n=1
n=1
np22
np22
n=1
i=1
n
E|Ani |2 EWni2
i=1
n
E|Ani |2
n2 P (V > n ) + EV I(V n )2
i=1
(by (2.21))
C
C
=C
n=1
n=1
n
np12
E V 2 I (i 1) < V i + CEV p (by (4.7))
n=1
i=1
np12 E V 2 I (i 1) < V i + CEV p
i=1 n=i
ip2E V 2 I((i 1) < V i ) + CEV p
i=1
ipP (i 1) < V i + CEV p
i=1
CEV p < .
This proves (4.9). The proof of the theorem is completed.
Remark 4.2.
(i) When > 1, condition (4.2) is automatically satisfied. To see this, for all
n 1,
E|Ani |
2
1773
n
2
i=1
i=1
n
i=1
EA2ni .
(4.10)
E|Ani| = O(n).
i=1
Hence
n
Ani Vni I(Vni n )
0 lim n E
n
lim n
n
n
i=1
i=1
lim Cn
n
E|Ani|
EV I(V n ) + n P (V > n )
i=1
(by (2.21))
lim Cn1 EV (by (4.10))
n
(4.11)
n1, i1
|ani | < ,
then the condition (4.1) is satisfied automatically. Moreover, the condition (4.2) can
be replaced by
(4.12)
n
i=1
To see this, by Lemma 2.2 and (4.12), we can assume that for each n 1, {Vni , 1
i n} are symmetric random elements. By Remark 4.2, we need only prove (4.2)
when 0 < 1. We have
1774
0 lim n
n
i=1
lim n
n
n
E
ani Vni I(Vni > n )
n
i=1
lim Cn
n
n
|ani | EV I(V > n ) (by (2.22))
i=1
n
i=1
n
i=1
n
i=1
The proof is similar to that of Theorem 4.1, by applying Lemma 2.1 with r = q/2.
The verbatim argument is omitted.
Now, if we consider Vni ani Vni as a linear operator fni : X X , then
we have the following theorem. The proof is exactly as that of Theorem 4.1 and
Remark 4.4.
1775
(4.16)
i=1
and if either
1 p < 2,
(4.17)
n
fni 2 = O(n),
i=1
or
(4.18)
n
p 2,
i=1
then
(4.19)
p2
n
P
fni (Vni) > n < for all > 0.
n=1
i=1
i=1
i=1
(4.20)
E(|Ani|) = O(n),
i=1
then
(4.21)
n=1
p2
P
k
max
Ani Vni > n < for all > 0.
1kn
i=1
1776
Proof. Let W ni be as in the proof of Theorem 4.1. We need only prove the
theorem for p 1. For all > 0,
np2 P
n=1
max
1kn
1
np2 E
n=1
C
=C
C
n=1
n=1
Ani Wni > n
i=1
max
1kn
n
np2
k
k
Ani Wni (by Chebyshevs inequality)
i=1
E Ani Wni
i=1
n
np2
np2
i=1
n
n=1
E|Ani |
i=1
(by (2.21))
(4.22)
C
n=1
n=1
(by (4.20))
C
=C
np1
n=1
n
E V I (i 1) < V i + CEV p
i=1
np1 E V I (i 1) < V i + CEV p
i=1 n=i
i=1
ip E V I((i 1) < V i ) + CEV p
ip P (i 1) < V i + CEV p
i=1
CEV p < .
np2 P max1in Vni > n CEV p < .
(4.23)
n=1
Since
P
P
k
Ani Vni > n
max
1kn
i=1
1in
+P
max
1kn
k
i=1
Ani Wni > n ,
1777
(5.1)
n1 1in
If
n
ani Vni 0 in probability as n ,
(5.2)
i=1
then
(5.3)
n
np2 P
ani Vni > n < for all > 0.
n=1
i=1
Proof. Set Ani ani a.s. Since (4.1) and (4.15) are immediately consequences
of (5.1), Corollary 5.1 follows from Theorem 4.1, Remark 4.3 and Remark 4.4
Remark 5.2. Corollary 5.1 extends the result of Wang et al. [25] and provides
better convergence rates.
(i) We only assume (5.2), whereas Wang et al. [25] assume (1.6).
(ii) We allow p 1, whereas Wang et al. [25] require that p > 1.
Corollary 5.3. Let 1/2 t < 2 and let {V ni , n 1, 1 i n} be an array
of row-wise independent random elements that are stochastically dominated by a
random element V with EV 2t < . Let {ani , n 1, 1 i n} be an array
of constants satisfying
sup sup |ani | < .
(5.4)
n1 1in
If
(5.5)
n
ani Vni 0 in probability as n ,
n1/t
i=1
then
(5.6)
n
P
ani Vni > n1/t < for all > 0.
n=1
i=1
1778
Proof. Let p = 2t, = 2/p = 1/t. Noting that 1/2 t < 2 implies > 1/2.
Therefore Corollary 5.3 follows from Corollary 5.1.
Remark 5.4. Let ani n1/tbni . Then Corollary 5.3 implies the p < 2 part
of Sung [20]. If the Banach space is real valued and EVni = 0, n 1, 1 i n,
then by Remark 4.2 (ii), Corollary 5.3 also extends result of Hu et al. [10].
Next we consider two illustrative examples. Recall that p (where p 1) is
th
summable real sequences
the real separable Banach space of absolute
p p-power
v = {vi , i 1} with norm ||v|| = ( i=1 |vi | )1/p. The element of p having
1 in its n th position and 0 elsewhere will be denoted by v (n) , n 1. Define a
sequence {Wn , n 1} of independent 0-mean random elements in p by requiring
the {Vn , n 1} to be independent with
P {Wn = v (n) } = P {Wn = v (n) } =
1
, n 1.
2
The random elements {Wn , n 1} will be used in the first example. This
example shows that the condition (4.2) cannot be removed in Theorem 4.1.
Example 5.5. Let 1 p < 2, = 1/p and consider the Banach space p
and the sequence {Wn , n 1} of independent 0-mean random elements in p . Let
Vni = Wi for all n 1. Then {Vni , n 1, 1 i n} is stochastically dominated
by W1 that satisfies EW 1 p < . Let {Ani , n 1, 1 i n} be an array of
row-wise independent random variables such that the sequences {A ni , i 1} and
{Vni , i 1} are independent for all n 1, and for all n 1 and 1 i n,
(5.7)
Then Vni = 1 a.s. for all n 1, 1 i n and the condition (4.1) is satisfied.
Since
n
Ani Vni = n1/p a.s.,
(5.8)
i=1
and so the (4.2) fails. It is easy to see that (4.3) also fails.
By applying Ho lders inequality, if
(5.9)
n
i=1
then
(5.10)
n
i=1
1779
The following example shows that in Theorem 4.1, we cannot replace (4.1) by the
weaker condition
n
(5.11)
E|Ani|p = O(n).
i=1
n
Ani Vni I(|Vni| n ) = E|Vnn | = 1/ log(n + 1)
n E
i=1
(5.15)
n
Ani Vni > n
P
i=1
= P |Vnn | > = 1/ log(n + 1) for all 0 < < 1,
REFERENCES
1. A. de Acosta, Inequalities for B-valued random vectors with applications to the strong
law of large numbers, Ann. Probab., 9 (1981), 157-161.
2. A. Adler, A. Rosalsky and R. L. Taylor, Strong laws of large numbers for weighted
sums of random elements in normed linear spaces, Internat. J. Math. Math. Sci., 12
(1989), 507-529.
3. S. E. Ahmed, R. G. Antonini and A. Volodin, On the rate of complete convergence for
weighted sums of arrays of Banach space valued random elements with application
to moving average processes, Statist. Probab. Lett., 58 (2002), 185-194.
4. L. E. Baum and M. Katz, Convergence rates in the law of large numbers, Trans.
Amer. Math. Soc., 120 (1965), 108-123.
1780
5. J. Cuzick, A strong law for weighted sums of i.i.d. random variables, J. Theoret.
Probab., 8(3) (1995), 625-641.
6. J. Cuzick, Erratum: A strong law for weighted sums of i.i.d. random variables. J.
Theoret. Probab., 14(2) (2001), 605.
7. P. Erdo s, On a theorem of Hsu and Robbins, Ann. Math. Statist., 20 (1949), 286-291.
8. V. Herna ndez, H. Urmeneta and A. Volodin, On complete convergence for arrays of
random elements and variables, Stoch. Anal. Appl., 25 (2007), 281-291.
9. P. L. Hsu and H. Robbins, Complete convergence and the law of large numbers,
Proc. Nat. Acad. Sci. U.S.A., 33 (1947), 25-31.
10. T. C. Hu, F. Mo ricz and R. L. Taylor, Strong laws of large numbers for arrays of
rowwise independent random variables, Acta Math. Hungar., 54(1-2) (1989), 153162.
11. T. C. Hu, A. Rosalsky, D. Szynal and A. Volodin, On complete convergence for arrays
of rowwise independent random elements in Banach spaces, Stoch. Anal. Appl., 17
(1999), 963-992.
12. B. Y. Jing and H. Y. Liang, Strong limit theorems for weighted sums of negatively
associated random variables, J. Theoret. Probab., 21(4) (2008), 890-909.
13. H. J. Kushner and A. Shwartz, Stochastic approximation in Hilbert space: Identification and optimization of linear continuous parameter systems, SIAM J. Control
Optim., 23 (1985), 774-793.
14. H. J. Kushner and G. Yin, Stochastic Approximation and Recursive Algorithms and
Applications, 2nd ed., Springer-Verlag, New York, NY, 2003.
15. D. L. Li, On moments of the supremum of normed weighted averages, Canadian J.
Statist., 24(3) (1996), 279-292.
16. D. L. Li, M. B. Rao, T. F. Jiang and X. C. Wang, Complete convergence and almost
sure convergence of weighted sums of random variables, J. Theoret. Probab., 8(1)
(1995), 49-76.
17. D. L. Li, M. B. Rao and X. C. Wang, On the strong law of large numbers and
the law of the logarithm for weighted sums of independent random variables with
multidimensional indices, J. Multivariate Anal., 52(2) (1995), 181-198.
18. D. Li and R. J. Tomkins, The law of the logarithm for weighted sums of independent
random variables, J. Theoret. Probab., 16(3) (2003), 519-542.
19. S. H. Sung, H. Urmeneta and A. Volodin, On complete convergence for arrays of
random elements, Stoch. Anal. Appl., 26 (2008), 595-602.
20. S. H. Sung, Complete convergence for weighted sums of arrays of rowwise independent B-valued random variables, Stochastic Anal. Appl., 15(2) (1997), 255-267.
21. S. H. Sung, A note on the complete convergence for arrays of rowwise independent
random elements, Statist. Probab. Lett., 78 (2008), 1283-1289.
1781
22. S. H. Sung, M. Ordo n ez Cabrera and T. C. Hu, On complete convergence for arrays
of rowwise independent random elements, J. Korean Math. Soc., 44 (2007), 467-476.
23. R. L. Taylor, Stochastic Convergence of Weighted Sums of Random Elements in
Linear Spaces, Lecture Notes in Math. Vol. 672, Springer-Verlag, Berlin, 1978.
24. R. Thrum, A remark on almost sure convergence of weighted sums, Probab. Theory
Related Fields, 75(3) (1987), 425-430.
25. X. C. Wang, M. B. Rao and X. Y. Yang, Convergence rates on strong laws of large
numbers for arrays of rowwise independent elements, Stoch. Anal. Appl., 11 (1993),
115-132.
Le Van Thanh
Department of Mathematics
Vinh University
Nghe An 42118
Vietnam
E-mail: levt@vinhuni.edu.vn
G. Yin
Department of Mathematics
Wayne State University
Detroit, MI 48202
U.S.A.
E-mail: gyin@math.wayne.edu