Convergence rates in the law of large numbers. II

1968 ◽  
Vol 64 (2) ◽  
pp. 485-488 ◽  
Author(s):  
V. K. Rohatgi
Keyword(s):  
Convergence Rates ◽  
Random Variables ◽  
Almost Sure Convergence ◽  
Random Variable ◽  
Rates Of Convergence ◽  
Independent Random Variables ◽  
Large Numbers ◽  
Present Context ◽  
Image Position ◽  
Uniformly Bounded

Let {Xn: n ≥ 1} be a sequence of independent random variables and write Suppose that the random vairables Xn are uniformly bounded by a random variable X in the sense thatSet qn(x) = Pr(|Xn| > x) and q(x) = Pr(|Xn| > x). If qn ≤ q and E|X|r < ∞ with 0 < r < 2 then we have (see Loève(4), 242)where ak = 0, if 0 < r < 1, and = EXk if 1 ≤ r < 2 and ‘a.s.’ stands for almost sure convergence. the purpose of this paper is to study the rates of convergence ofto zero for arbitrary ε > 0. We shall extend to the present context, results of (3) where the case of identically distributed random variables was treated. The techniques used here are strongly related to those of (3).

Some central limit analogues for supercritical Galton-Watson processes

1971 ◽  
Vol 8 (01) ◽  
pp. 52-59 ◽  
Author(s):  
C. C. Heyde
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Random Variables ◽  
Almost Sure Convergence ◽  
Independent Random Variables ◽  
Strong Law ◽  
Large Numbers ◽  
Watson Process ◽  
Image Position

It is possible to interpret the classical central limit theorem for sums of independent random variables as a convergence rate result for the law of large numbers. For example, ifXi, i= 1, 2, 3, ··· are independent and identically distributed random variables withEXi=μ, varXi= σ2&lt; ∞ andthen the central limit theorem can be written in the formThis provides information on the rate of convergence in the strong lawas. (“a.s.” denotes almost sure convergence.) It is our object in this paper to discuss analogues for the super-critical Galton-Watson process.

Some central limit analogues for supercritical Galton-Watson processes

1971 ◽  
Vol 8 (1) ◽  
pp. 52-59 ◽  
Author(s):  
C. C. Heyde
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Random Variables ◽  
Almost Sure Convergence ◽  
Independent Random Variables ◽  
Strong Law ◽  
Large Numbers ◽  
Watson Process ◽  
Image Position

It is possible to interpret the classical central limit theorem for sums of independent random variables as a convergence rate result for the law of large numbers. For example, if Xi, i = 1, 2, 3, ··· are independent and identically distributed random variables with EXi = μ, var Xi = σ2 < ∞ and then the central limit theorem can be written in the form This provides information on the rate of convergence in the strong law as . (“a.s.” denotes almost sure convergence.) It is our object in this paper to discuss analogues for the super-critical Galton-Watson process.

REFINEMENT OF CONVERGENCE RATES FOR WEIGHTED SUMS OF INDEPENDENT RANDOM VARIABLES

2012 ◽  
Vol 05 (01) ◽  
pp. 1250007
Author(s):  
Si-Li Niu ◽  
Jong-Il Baek
Keyword(s):  
Law Of Large Numbers ◽  
Convergence Rates ◽  
Random Variables ◽  
Independent Random Variables ◽  
Weighted Sums ◽  
Counting Processes ◽  
Precise Asymptotics ◽  
Strong Law ◽  
Large Numbers ◽  
Passage Times

In this paper, we establish one general result on precise asymptotics of weighted sums for i.i.d. random variables. As a corollary, we have the results of Lanzinger and Stadtmüller [Refined Baum–Katz laws for weighted sums of iid random variables, Statist. Probab. Lett. 69 (2004) 357–368], Gut and Spătaru [Precise asymptotics in the law of the iterated logarithm, Ann. Probab. 28 (2000) 1870–1883; Precise asymptotics in the Baum–Katz and Davis laws of large numbers, J. Math. Anal. Appl. 248 (2000) 233–246], Gut and Steinebach [Convergence rates and precise asymptotics for renewal counting processes and some first passage times, Fields Inst. Comm. 44 (2004) 205–227] and Heyde [A supplement to the strong law of large numbers, J. Appl. Probab. 12 (1975) 173–175]. Meanwhile, we provide an answer for the possible conclusion pointed out by Lanzinger and Stadtmüller [Refined Baum–Katz laws for weighted sums of iid random variables, Statist. Probab. Lett. 69 (2004) 357–368].

scholarly journals Strong laws of large numbers for arrays of rowwise independent random elements

1987 ◽  
Vol 10 (4) ◽  
pp. 805-814 ◽  
Author(s):  
Robert Lee Taylor ◽  
Tien-Chung Hu
Keyword(s):  
Banach Space ◽  
Separable Banach Space ◽  
Complete Convergence ◽  
Almost Sure Convergence ◽  
Random Variable ◽  
Laws Of Large Numbers ◽  
Large Numbers ◽  
Random Elements ◽  
Rowwise Independent ◽  
Uniformly Bounded

Let{Xnk}be an array of rowwise independent random elements in a separable Banach space of typep+δwithEXnk=0for allk,n. The complete convergence (and hence almost sure convergence) ofn−1/p∑k=1nXnk to 0,1≤p<2, is obtained when{Xnk}are uniformly bounded by a random variableXwithE|X|2p<∞. When the array{Xnk}consists of i.i.d, random elements, then it is shown thatn−1/p∑k=1nXnkconverges completely to0if and only ifE‖X11‖2p<∞.

SOME LIMITING BEHAVIOR FOR ASYMPTOTICALLY NEGATIVE ASSOCIATED RANDOM VARIABLES

2016 ◽  
Vol 32 (1) ◽  
pp. 58-66 ◽  
Author(s):  
Qunying Wu ◽  
Yuanying Jiang
Keyword(s):  
Convergence Theorem ◽  
Law Of Large Numbers ◽  
Random Variables ◽  
Almost Sure Convergence ◽  
Independent Random Variables ◽  
Strong Law ◽  
Limiting Behavior ◽  
Associated Random Variables ◽  
Large Numbers

In this paper, we study the almost sure convergence for sequences of asymptotically negative associated (ANA) random variables. As a result, we extend the classical Khintchine–Kolmogorov convergence theorem, Marcinkiewicz strong law of large numbers, and the three series theorem for sequences of independent random variables to sequences of ANA random variables without necessarily adding any extra conditions.

Maximal branching processes and ‘long-range percolation’

1970 ◽  
Vol 7 (01) ◽  
pp. 89-98
Author(s):  
John Lamperti
Keyword(s):  
Probability Distribution Function ◽  
Branching Process ◽  
Branching Processes ◽  
Random Variables ◽  
Random Variable ◽  
Independent Random Variables ◽  
Transition Matrices ◽  
A Chain ◽  
Image Position ◽  
The Right

In the first part of this paper, we will consider a class of Markov chains on the non-negative integers which resemble the Galton-Watson branching process, but with one major difference. If there are k individuals in the nth “generation”, and are independent random variables representing their respective numbers of offspring, then the (n + 1)th generation will contain max individuals rather than as in the branching case. Equivalently, the transition matrices Pij of the chains we will study are to be of the form where F(.) is the probability distribution function of a non-negative, integervalued random variable. The right-hand side of (1) is thus the probability that the maximum of i independent random variables distributed by F has the value j. Such a chain will be called a “maximal branching process”.

scholarly journals Negatively dependent bounded random variable probability inequalities and the strong law of large numbers

2000 ◽  
Vol 13 (3) ◽  
pp. 261-267 ◽  
Author(s):  
M. Amini ◽  
A. Bozorgnia
Keyword(s):  
Law Of Large Numbers ◽  
Random Variables ◽  
Random Variable ◽  
Strong Law ◽  
Probability Inequalities ◽  
Large Numbers ◽  
Bounded Random Variable ◽  
Strongly Consistent ◽  
Uniformly Bounded ◽  
Variable Probability

Let X1,…,Xn be negatively dependent uniformly bounded random variables with d.f. F(x). In this paper we obtain bounds for the probabilities P(|∑i=1nXi|≥nt) and P(|ξˆpn−ξp|>ϵ) where ξˆpn is the sample pth quantile and ξp is the pth quantile of F(x). Moreover, we show that ξˆpn is a strongly consistent estimator of ξp under mild restrictions on F(x) in the neighborhood of ξp. We also show that ξˆpn converges completely to ξp.

Sign in / Sign up

Export Citation Format

Share Document