scholarly journals Almost sure central limit theorems for strongly mixing and associated random variables

2002 ◽  
Vol 29 (3) ◽  
pp. 125-131 ◽  
Author(s):  
Khurelbaatar Gonchigdanzan

We prove an almost sure central limit theorem (ASCLT) for strongly mixing sequence of random variables with a slightly slow mixing rateα(n)=O((loglogn)−1−δ). We also show that ASCLT holds for an associated sequence of random variables without a stationarity assumption.

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Yuanying Jiang ◽  
Qunying Wu

In this paper, the almost sure central limit theorem is established for sequences of negatively associated random variables:limn→∞(1/logn)∑k=1n(I(ak≤Sk<bk)/k)P(ak≤Sk<bk)=1, almost surely. This is the local almost sure central limit theorem for negatively associated sequences similar to results by Csáki et al. (1993). The results extend those on almost sure local central limit theorems from the i.i.d. case to the stationary negatively associated sequences.


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).


1994 ◽  
Vol 26 (01) ◽  
pp. 104-121 ◽  
Author(s):  
Allen L. Roginsky

A central limit theorem for cumulative processes was first derived by Smith (1955). No remainder term was given. We use a different approach to obtain such a term here. The rate of convergence is the same as that in the central limit theorems for sequences of independent random variables.


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.


Author(s):  
L. ACCARDI ◽  
V. CRISMALE ◽  
Y. G. LU

Cabana-Duvillard and lonescu11 have proved that any symmetric probability measure with moments of any order can be obtained as central limit theorem of self-adjoint, weakly independent and symmetrically distributed (in a quantum souse) random variables. Results of this type will be called "universal central limit theorem". Using Interacting Fock Space (IFS) techniques we extend this result in two directions: (i) we prove that the random variables can be taken to be generalized Gaussian in the sense of Accardi and Bożejko3 and we give a realization of such random variables as sums of creation, annihilation and preservation operators acting on an appropriate IFS; (ii) we extend the above-mentioned result to the nonsymmetric case. The nontrivial difference between the symmetric and the nonsymmetric case is explained at the end of the introduction below.


Author(s):  
BERNARDO B. DE ANDRADE ◽  
CHARLES J. GEYER

We prove a nonstandard central limit theorem for strongly mixing stationary sequences using the "radically elementary" probability theory developed by Nelson (1987) and use this result to obtain a nonstandard Markov chain central limit theorem. An analogue of a Gaussian autoregressive process is used to illustrate how to obtain the rate of convergence. A Markov chain nonstandard functional central limit theorem is also proved under conditions similar to square integrability of the underlying martingale.


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.


Sign in / Sign up

Export Citation Format

Share Document