Almost sure limit theorems for random allocations

2005 ◽  
Vol 42 (2) ◽  
pp. 173-194
Author(s):  
István Fazekas ◽  
Alexey Chuprunov

Almost sure limit theorems are presented for random allocations. A general almost sure limit theorem is proved for arrays of random variables. It is applied to obtain almost sure versions of the central limit theorem for the number of empty boxes when the parameters are in the central domain. Almost sure versions of the Poisson limit theorem in the left domain are also proved.

1997 ◽  
Vol 13 (3) ◽  
pp. 353-367 ◽  
Author(s):  
Robert M. de Jong

This paper presents central limit theorems for triangular arrays of mixingale and near-epoch-dependent random variables. The central limit theorem for near-epoch-dependent random variables improves results from the literature in various respects. The approach is to define a suitable Bernstein blocking scheme and apply a martingale difference central limit theorem, which in combination with weak dependence conditions renders the result. The most important application of this central limit theorem is the improvement of the conditions that have to be imposed for asymptotic normality of minimization estimators.


2021 ◽  
Vol 36 (2) ◽  
pp. 243-255
Author(s):  
Wei Liu ◽  
Yong Zhang

AbstractIn this paper, we investigate the central limit theorem and the invariance principle for linear processes generated by a new notion of independently and identically distributed (IID) random variables for sub-linear expectations initiated by Peng [19]. It turns out that these theorems are natural and fairly neat extensions of the classical Kolmogorov’s central limit theorem and invariance principle to the case where probability measures are no longer additive.


1992 ◽  
Vol 24 (2) ◽  
pp. 267-287 ◽  
Author(s):  
Allen L. Roginsky

Three different definitions of the renewal processes are considered. For each of them, a central limit theorem with a remainder term is proved. The random variables that form the renewal processes are independent but not necessarily identically distributed and do not have to be positive. The results obtained in this paper improve and extend the central limit theorems obtained by Ahmad (1981) and Niculescu and Omey (1985).


1978 ◽  
Vol 10 (04) ◽  
pp. 852-866
Author(s):  
A. J. Stam

Let be a family of random walks with For ε↓0 under certain conditions the random walk U (∊) n converges to an oscillating random walk. The ladder point distributions and expectations converge correspondingly. Let M ∊ = max {U (∊) n , n ≧ 0}, v 0 = min {n : U (∊) n = M ∊}, v 1 = max {n : U (∊) n = M ∊}. The joint limiting distribution of ∊2σ∊ –2 v 0 and ∊σ∊ –2 M ∊ is determined. It is the same as for ∊2σ∊ –2 v 1 and ∊σ–2 ∊ M ∊. The marginal ∊σ–2 ∊ M ∊ gives Kingman's heavy traffic theorem. Also lim ∊–1 P(M ∊ = 0) and lim ∊–1 P(M ∊ < x) are determined. Proofs are by direct comparison of corresponding probabilities for U (∊) n and for a special family of random walks related to MI/M/1 queues, using the central limit theorem.


1972 ◽  
Vol 12 (4) ◽  
pp. 183-194
Author(s):  
V. Paulauskas

The abstracts (in two languages) can be found in the pdf file of the article. Original author name(s) and title in Russian and Lithuanian: В. Паулаускас. Оценка скорости сходимости в центральной предельной теореме для разнораспределенных слагаемых V. Paulauskas. Konvergavimo greičio įvertinimas centrinėje ribinėje teoremoje nevienodai pasiskirsčiusiems dėmenims


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Mingzhou Xu ◽  
Kun Cheng

By an inequality of partial sum and uniform convergence of the central limit theorem under sublinear expectations, we establish precise asymptotics in the law of the iterated logarithm for independent and identically distributed random variables under sublinear expectations.


1969 ◽  
Vol 10 (1-2) ◽  
pp. 219-230
Author(s):  
C. R. Heathcote

Let X1, X2,…be independent and identically distributed non-lattice random variables with zero, varianceσ2<∞, and partial sums Sn = X1+X2+…+X.


Sign in / Sign up

Export Citation Format

Share Document