Related papers: A simple invariance theorem

We give a simple proof of the Fourier Inversion Theorem, using the methods of nonstandard analysis.

We adapt arguments concerning information-theoretic convergence in the Central Limit Theorem to the case of dependent random variables under Rosenblatt mixing conditions. The key is to work with random variables perturbed by the addition of…

We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the…

We prove moment inequalities for a class of functionals of i.i.d. random fields. We then derive rates in the central limit theorem for weighted sums of such randoms fields via an approximation by $m$-dependent random fields.

We prove a universality theorem for learning with random features. Our result shows that, in terms of training and generalization errors, a random feature model with a nonlinear activation function is asymptotically equivalent to a…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

We revisit the moment method to obtain a slightly strengthened version of the usual semicircular law. Our version assumes only that the upper triangular entries of Hermitian random matrices are independent, have mean zero and variances…

The first aim of this paper is to wonder to what extent we can generalize the central limit theorem of Gordin [5] under the so-called L 1-projective criteria to ergodic stationary random fields when completely commuting filtrations are…

We provide an improved version of the Darling-Erd\"os theorem for sums of i.i.d. random variables with mean zero and finite variance. We extend this result to multidimensional random vectors. Our proof is based on a new strong invariance…

We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…

We prove a central limit theorem for a random field generated by d commuting probability preserving transformations; the martingale is given by a commuting filtration (cf. D. Khosnevisan, Multiparameter Processes, Springer 2002). The result…

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 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 prove the Central Limit Theorem (CLT), the first order Edgeworth Expansion and a Mixing Local Central Limit Theorem (MLCLT) for Birkhoff sums of a class of unbounded heavily oscillating observables over a family of full-branch piecewise…

Recently a new type of central limit theorem for belief functions was given in Epstein et al. [9]. In this paper, we generalize the central limit theorem in Epstein et al. [9] to accommodate general bounded random variables. These results…

Fix an irrational number $\alpha$, and consider a random walk on the circle in which at each step one moves to $x+\alpha$ or $x-\alpha$ with probabilities $1/2, 1/2$ provided the current position is $x$. If an observable is given we can…

We give a new, self-contained proof of the multidimensional central limit theorem using the technique of ``doubling variables," which is traditionally used to prove uniqueness of solutions of partial differential equations (PDEs). Our…

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

We use Stein's method to prove a generalization of the Lindeberg-Feller CLT providing an upper and a lower bound for the superior limit of the Kolmogorov distance between a normally distributed random variable and the rowwise sums of a…

We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…