Related papers: Approximate central limit theorems
Stochastic dynamical systems consisting of non-invertible continuous maps on an interval are studied. It is proved that if they satisfy the recently introduced so-called $\mu$-injectivity and some mild assumptions, then proximality,…
This work presents the first systematic development of Stein's method for matrix distributions. We establish the basic essential ingredients of Stein's method for matrix normal approximation: we derive a generator-based Stein identity from…
We investigate three types of averaging principles and the normal deviation for multi-scale stochastic differential equations (in short, SDEs) with polynomial nonlinearity. More specifically, we first demonstrate the strong convergence of…
In this article we propose a general framework for normal approximation using Stein's method. We introduce the new concept of Stein couplings and we show that it lies at the heart of popular approaches such as the local approach,…
The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…
The random intersection graph model $\mathcal G(n,m,p)$ is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is significantly more challenging than in the classical binomial…
A key feature of a sequential study is that the actual sample size is a random variable that typically depends on the outcomes collected. While hypothesis testing theory for sequential designs is well established, parameter and precision…
We consider a borderline case: the central limit theorem for a strictly stationary time series with infinite variance but a Gaussian limit. In the iid case a well-known sufficient condition for this central limit theorem is regular…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
We develop a general method to study the Fisher information distance in central limit theorem for nonlinear statistics. We first construct completely new representations for the score function. We then use these representations to derive…
The aim of the present work is to show that recent results of the authors on the approximation of distributions of sums of independent summands by the infinitely divisible laws on convex polyhedra can be shown via an alternative class of…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
We obtain some sufficient conditions for the Central Limit Theorem for the random processes (fields) with values in the separable part of Holder space in the modern terms of majorizing (minorizing) measures, belonging to X.Fernique and…
By a delicate analysis for the Stein's equation associated to the $\alpha$-stable law approximation with $\alpha \in (0,2)$, we prove a quantitative stable central limit theorem in Wasserstein type distance, which generalizes the results in…
We present and discuss the many results obtained concerning a famous limit theorem, the local limit theorem, which has many interfaces, with Number Theory notably, and for which, in spite of considerable efforts, the question concerning…
Under correlation-type conditions, we derive an upper bound of order $(\log n)/n$ for the average Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. The result is based on improved…
We provide a sufficient characterization for subsets $\mathcal{A}$ of the polynomial ring $\mathbb{F}_q[t]$ for which partial sums of Steinhaus random multiplicative functions approach a complex standard normal distribution. This extends…
We analyze the fluctuations of incomplete $U$-statistics over a triangular array of independent random variables. We give criteria for a Central Limit Theorem (CLT, for short) to hold in the sense that we prove that an appropriately scaled…
We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem,…
Hambly, Keevash, O'Connell and Stark have proven a central limit theorem for the characteristic polynomial of a permutation matrix with respect to the uniform measure on the symmetric group. We generalize this result in several ways. We…