Rate of convergence in the law of large numbers for normalized sums of moments

1981 ◽  
Vol 21 (1) ◽  
pp. 99-106
Author(s):  
P. Survila
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.


1982 ◽  
Vol 22 (2) ◽  
pp. 105-111
Author(s):  
G. Bakštys ◽  
R. Norvaiša

2005 ◽  
Vol 2005 (1) ◽  
pp. 55-66
Author(s):  
Rohitha Goonatilake

The convolution summability method is introduced as a generalization of the random-walk method. In this paper, two well-known summability analogs concerning the strong law of large numbers (SLLN) and the law of the single logarithm (LSL), that gives the rate of convergence in SLLN for the random-walk method, are extended to this generalized method.


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Jing Chen ◽  
Zengjing Chen

Abstract In this article, we employ the elementary inequalities arising from the sub-linearity of Choquet expectation to give a new proof for the generalized law of large numbers under Choquet expectations induced by 2-alternating capacities with mild assumptions. This generalizes the Linderberg–Feller methodology for linear probability theory to Choquet expectation framework and extends the law of large numbers under Choquet expectation from the strong independent and identically distributed (iid) assumptions to the convolutional independence combined with the strengthened first moment condition.


2006 ◽  
Vol 73 (4) ◽  
pp. 673-686 ◽  
Author(s):  
M. A. Milevsky ◽  
S. D. Promislow ◽  
V. R. Young

Sign in / Sign up

Export Citation Format

Share Document