Related papers: A Central Limit Theorem for non-overlapping return…

We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than {\epsilon} ({\epsilon} > 0). It is known ([BM05]) that the empirical measure of these fragments converges in law, under some…

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 an ergodic process on finitely many states, with positive entropy. Our first main result asserts that the distribution function of the normalized waiting time for the first visit to a small (i.e., over a long block) cylinder set…

Under the sublinear expectation $\mathbb{E}[\cdot]:=\sup_{\theta\in \Theta} E_\theta[\cdot]$ for a given set of linear expectations $\{E_\theta: \theta\in \Theta\}$, we establish a new law of large numbers and a new central limit theorem…

We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $\mu^{(r)}(d)$ as the density of integers $n\in…

For noncorrelated random variables, we study a concentration property of the family of distributions of normalized sums formed by sequences of times of a given large length.

In a paper from 1995, Wormald gave general criteria for certain parameters in a family of discrete random processes to converge to the solution of a system of differential equations. Based on this method, we show that if some further…

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…

Central limit theorems (CLTs) have a long history in probability and statistics. They play a fundamental role in constructing valid statistical inference procedures. Over the last century, various techniques have been developed in…

Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…

We observe the actions of a $K$ sub-sample of $N$ individuals up to time $t$ for some large $K\le N$. We model the relationships of individuals by i.i.d. Bernoulli($p$)-random variables, where $p\in (0,1]$ is an unknown parameter. The rate…

We provide sufficient conditions for polynomial rate of convergence in the weak law of large numbers for supercritical general indecomposable multi-type branching processes. The main result is derived by investigating the embedded…

For an arbitrary integer N that is at least 2, this paper gives a construction of a strictly stationary, N-tuplewise independent sequence of (non-degenerate) bounded random variables such that the Central Limit Theorem fails to hold. The…

We consider random walks in dynamic random environments which arise naturally as spatial embeddings of ancestral lineages in spatial locally regulated population models. In particular, as the main result, we prove the quenched central limit…

Two time scale stochastic approximation algorithms emulate singularly perturbed deterministic differential equations in a certain limiting sense, i.e., the interpolated iterates on each time scale approach certain differential equations in…

We consider the problem of directly optimizing a non-linear function of an outcome, where this outcome itself is the sum of many small contributions. The non-linearity of the function means that the problem is not equivalent to the…

We present a law of large numbers and a central limit theorem for the time to absorption of $\Lambda$-coalescents, started from $n$ blocks, as $n \to \infty$. The proofs rely on an approximation of the logarithm of the block-counting…

Often, when we consider the time evolution of a system, we resort to approximation: Instead of calculating the exact orbit, we divide the time interval in question into uniform segments. Chernoff's results in this direction provide us with…

We study a random walk in a N dimensional hypercube and exhibit results about stopping times when N diverges. The first theorem discusses the time in which two coupling processes spend to meet. A corollary provides a majorant for the…

A Central Limit Theorem for non-commutative random variables is proved using the Lindeberg method. The theorem is a generalization of the Central Limit Theorem for free random variables proved by Voiculescu. The Central Limit Theorem in…