Search arXiv⌕ Search

arXiv · 2610.12722

Effective-dimension bounds in the central limit theorem for centered Euclidean balls

Abstract

We establish a nonasymptotic Gaussian approximation bound over centered Euclidean balls for sums of independent, not necessarily identically distributed, random vectors in \(\mathbb R^p\). Let \(S_n\) denote the sum, let \(Σ=\operatorname{Var}(S_n)\), and let \(G\sim N(0,Σ)\). Define the effective rank and the normalized squared spectral mass by \[ r(Σ)=\frac{\operatorname{tr}Σ}{\|Σ\|}, \qquad v(Σ)=\frac{\operatorname{tr}(Σ^2)}{\|Σ\|^2}. \] Under a uniform directional fourth-moment condition, covariance-balance assumptions, and the spectral conditions \(r(Σ)\le C_Σv(Σ)\) and \(v(Σ)\ge6\), we prove \[ \sup_{z\ge0} \left| \mathbb P\{\|S_n\|^2\le z\} - \mathbb P\{\|G\|^2\le z\} \right| \le C\,\frac{r(Σ)^{3/2}}{n}. \] The constant depends only on the fixed parameters in the assumptions and is independent of the ambient dimension and individual small eigenvalues of the covariance matrix. The bound is uniform at the endpoint \(v(Σ)=6\), without a logarithmic loss. Its main feature is the combination of the \(n^{-1}\) rate with dependence on effective rank, including this endpoint. Consequently, the bound can vanish when \(r(Σ)=o(n^{2/3})\), even when \(p\) is much larger than \(n\). The same estimate extends to random elements of a separable Hilbert space with trace class covariance. The proof builds on the Fourier and symmetrization methods of \citet{GoetzeZaitsev2014}, combined with moment matching, truncation, and comparison estimates that retain the covariance structure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexey Naumov, Sergey Samsonov, Vladimir Spokoiny, Vladimir Ulyanov. 2026-10-08. Effective-dimension bounds in the central limit theorem for centered Euclidean balls. https://arxiv.org/abs/2610.12722

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Improved Mixing Rates of Directed Cycles with Additional Sparse Interconnections

We analyze the absolute spectral gap of Markov chains on graphs obtained from a cycle of $n$ vertices and perturbed only at approximately $n^{1/ρ}$ random locations with an appropriate, possibly sparse, interconnection structure. Together with a strong asymmetry along the cycle, the gap of the resulting chain can be bounded inversely proportionally by the longest arc length (up to logarithmic factors) with high probability, providing a significant mixing speedup compared to the reversible version.

math.PR↗

Strongly vertex-reinforced jump process on graphs with bounded degree

We study asymptotic behaviours of a non-linear vertex-reinforced jump process defined on an arbitrary infinite graph with bounded degree. We prove that if the reinforcement function $w$ is reciprocally integrable and non-decreasing, then the process visits only a finite number of vertices. In the case where $w$ is regularly varying with index $α>1$, we show that the process eventually gets stuck on a star-shaped subgraph and there is exactly one vertex with unbounded local time.

math.PR↗

A Note on the Stability of Monotone Markov Chains

This note studies monotone Markov chains, a subclass of Markov chains with extensive applications in operations research and economics. While the properties that ensure the global stability of these chains are well studied, their establishment often relies on the fulfillment of a certain splitting condition. We address the challenges of verifying the splitting condition by introducing simple, applicable conditions that ensure global stability. The simplicity of these conditions is demonstrated through various examples including autoregressive processes, portfolio allocation problems and resource allocation dynamics.

math.PR↗