Related papers: Almost Sure Central Limit Theorem in Sub-linear Ex…
We prove an almost sure central limit theorem on the Poisson space, which is perfectly tailored for stabilizing functionals emerging in stochastic geometry. As a consequence, we provide almost sure central limit theorems for $(i)$ the total…
We give a new proof of the classical Central Limit Theorem, in the Mallows ($L^r$-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…
We give simple proofs, under minimal hypotheses, of the Weak Law of Large Numbers and the Central Limit Theorem for independent identically distributed random variables. These proofs use only the elementary calculus, together with the most…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…
In this paper we estimate the rest of the approximation of a stationary process by a martingale in terms of the projections of partial sums. Then, based on this estimate, we obtain almost sure approximation of partial sums by a martingale…
The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…
We establish the central limit theorem for linear processes with dependent innovations including martingales and mixingale type of assumptions as defined in McLeish [Ann. Probab. 5 (1977) 616--621] and motivated by Gordin [Soviet Math.…
We derive a strong law of large numbers, a central limit theorem, a law of the iterated logarithm and a large deviation theorem for so-called deviation means of independent and identically distributed random variables (for the strong law of…
In this paper we survey the almost sure central limit theorem and its functional form (quenched) for stationary and ergodic processes. For additive functionals of a stationary and ergodic Markov chain these theorems are known under the…
We obtain an almost sure limit theorem for the maximum of nonstationary random fields under some dependence conditions.
In this paper, we give the concepts of properly distributed and simply distributed sequences, and prove that they are almost convergent. Basing on these, we review the work of Feng and Li [Feng, B. Q. and Li, J. L., Some estimations of…
We prove that the solution of the Kac analogue of Boltzmann's equation can be viewed as a probability distribution of a sum of a random number of random variables. This fact allows us to study convergence to equilibrium by means of a few…
For normalized sums $Z_n$ of i.i.d. random variables, we explore necessary and sufficient conditions which guarantee the normal approximation with respect to the R\'enyi divergence of infinite order. In terms of densities $p_n$ of $Z_n$,…
Stochastic approximation algorithms have been the subject of an enormous body of literature, both theoretical and applied. Recently, Laruelle and Pag\`es (2013) presented a link between the stochastic approximation and response-adaptive…
We establish central limit theorems for a large class of supercritical branching Markov processes in infinite dimension with spatially dependent and non-necessarily local branching mechanisms. This result relies on a fourth moment…
A non-classical formulation of the central limit theorem is given for sequences of independent random variables with finite second moments. Singular sequences whose members all have a degenerate or normal distribution are excluded from…
The standard central limit theorem plays a fundamental role in Boltzmann-Gibbs statistical mechanics. This important physical theory has been generalized \cite{Tsallis1988} in 1988 by using the entropy $S_q = \frac{1-\sum_i p_i^q}{q-1}$…
In this paper we study the almost sure conditional central limit theorem in its functional form for a class of random variables satisfying a projective criterion. Applications to strongly mixing processes and non irreducible Markov chains…
We provide numerical indications of the $q$-generalised central limit theorem that has been conjectured (Tsallis 2004) in nonextensive statistical mechanics. We focus on $N$ binary random variables correlated in a {\it scale-invariant} way.…