English
Related papers

Related papers: The Berry-Esseen Bound for High-dimensional Self-n…

200 papers

We prove that the sum of $t$ boolean-valued random variables sampled by a random walk on a regular expander converges in total variation distance to a discrete normal distribution at a rate of $O(\lambda/t^{1/2-o(1)})$, where $\lambda$ is…

Probability · Mathematics 2023-05-05 Louis Golowich

We obtain explicit Berry-Esseen bounds in the Kolmogorov distance for the normal approximation of non-linear functionals of vectors of independent random variables. Our results are based on the use of Stein's method and of random difference…

Probability · Mathematics 2015-05-19 Raphaël Lachièze-Rey , Giovanni Peccati

We will prove the Berry-Esseen theorem for the number counting function of the circular $\beta$-ensemble (C$\beta$E), which will imply the central limit theorem for the number of points in arcs of the unit circle in mesoscopic and…

Probability · Mathematics 2023-12-15 Renjie Feng , Gang Tian , Dongyi Wei

In a recent paper the author obtained optimal bounds for the strong Gaussian approximation of sums of independent $\R^d$-valued random vectors with finite exponential moments. The results may be considered as generalizations of well-known…

Probability · Mathematics 2007-05-23 A. Yu. Zaitsev

We establish a central limit theorem for the unnormalized linear statistic of the Gaussian Unitary Ensemble under optimal conditions: the linear statistics converges if and only if the expression for the limiting variance is finite.

Probability · Mathematics 2015-10-14 Phil Kopel

Let $H$ be a real separable Hilbert space and $(a_k)_{k\in\mathbb{Z}}$ a sequence of bounded linear operators from $H$ to $H$. We consider the linear process $X$ defined for any $k$ in $\mathbb{Z}$ by…

Probability · Mathematics 2010-07-07 Mohamed EL Machkouri

It is numerically well known that moment-based tests for Gaussianity and estimators become increasingly unreliable at higher moment orders; however, this phenomenon has lacked rigorous mathematical justification. In this work, we establish…

Statistics Theory · Mathematics 2025-12-12 Andreas Basse-O'Connor , David Kramer-Bang

For complex multiple Wiener-It\^{o} integral, we present Berry-Ess\'een upper and lower bounds in terms of moments and kernel contractions under the Wasserstein distance. As a corollary, we simplify the previously known contraction…

Probability · Mathematics 2024-07-09 Huiping Chen , Yong Chen , Yong Liu

We prove finite-sample concentration and anti-concentration bounds for dimension estimation using Gaussian kernel sums. Our bounds provide explicit dependence on sample size, bandwidth, and local geometric and distributional parameters,…

Statistics Theory · Mathematics 2026-02-24 Martin Andersson

We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension $D$ to increase with the…

Statistics Theory · Mathematics 2013-09-27 Larry Wasserman , Mladen Kolar , Alessandro Rinaldo

In this work the $\ell_q$-norms of points chosen uniformly at random in a centered regular simplex in high dimensions are studied. Berry-Esseen bounds in the regime $1\leq q < \infty$ are derived and complemented by a non-central limit…

Probability · Mathematics 2020-05-12 Anastas Baci , Zakhar Kabluchko , Joscha Prochno , Mathias Sonnleitner , Christoph Thaele

We establish higher-order nonasymptotic expansions for a difference between probability distributions of sums of i.i.d. random vectors in a Euclidean space. The derived bounds are uniform over two classes of sets: the set of all Euclidean…

Statistics Theory · Mathematics 2022-11-30 Mayya Zhilova

We develop techniques for determining an explicit Berry-Esseen bound in the Kolmogorov distance for the normal approximation of a ratio of Gaussian functionals. We provide an upper bound in terms of the third and fourth cumulants, using…

Probability · Mathematics 2023-12-07 Khalifa Es-Sebaiy , Fares Alazemi

We give estimates on the rate of convergence in the Boolean central limit theorem for the L\'evy distance. In the case of measures with bounded support we obtain a sharp estimate by giving a qualitative description of this convergence.

Probability · Mathematics 2017-11-27 Octavio Arizmendi , Mauricio Salazar

Motivated by problems on random differences in Szemer\'{e}di's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the…

Combinatorics · Mathematics 2018-10-22 Jop Briët , Sivakanth Gopi

In the literature of high-dimensional central limit theorems, there is a gap between results for general limiting correlation matrix $\Sigma$ and the strongly non-degenerate case. For the general case where $\Sigma$ may be degenerate, under…

Probability · Mathematics 2023-05-30 Xiao Fang , Yuta Koike , Song-Hao Liu , Yi-Kun Zhao

Hwang's quasi-power theorem asserts that a sequence of random variables whose moment generating functions are approximately given by powers of some analytic function is asymptotically normally distributed. This theorem is generalised to…

Probability · Mathematics 2018-09-07 Clemens Heuberger , Sara Kropf

We obtain rates of convergence in limit theorems of partial sums $S_n$ for certain sequences of dependent, identically distributed random variables, which arise naturally in statistical mechanics, in particular, in the context of the…

Probability · Mathematics 2009-08-14 Peter Eichelsbacher , Matthias Löwe

Given a weakly dependent stationary process, we describe the transition between a Berry-Esseen bound and a second order Edgeworth expansion in terms of the Berry-Esseen characteristic. This characteristic is sharp: We show that Edgeworth…

Probability · Mathematics 2022-12-02 Moritz Jirak , Wei Biao Wu , Ou Zhao

A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is…

Information Theory · Computer Science 2020-05-12 Baris Nakiboglu