Explicit rates of approximation in the CLT for quadratic forms

preprint2014arXivOpen access

Abstract

Let X,X1,X2,…X,X_1,X_2,\ldots be i.i.d. Rd{\mathbb{R}}^d-valued real random vectors. Assume that EX=0{\mathbf{E}X=0}, cov⁡X=C\operatorname {cov}X=\mathbb{C}, E∥X∥2=σ2\mathbf{E}\Vert X\Vert^2=σ^2 and that XX is not concentrated in a proper subspace of Rd\mathbb{R}^d. Let GG be a mean zero Gaussian random vector with the same covariance operator as that of XX. We study the distributions of nondegenerate quadratic forms Q[SN]\mathbb{Q}[S_N] of the normalized sums SN=N−1/2(X1+⋯+XN){S_N=N^{-1/2}(X_1+\cdots+X_N)} and show that, without any additional conditions, ΔN=defsup⁡x∣P{Q[SN]≤x}−P{Q[G]≤x}∣=O(N−1),Δ_N\stackrel{\mathrm{def}}{=}\sup_x\bigl |\mathbf{P}\bigl\{\mathbb{Q}[S_N]\leq x\bigr\}-\mathbf{P}\bigl\{\mathbb{Q}[G]\leq x\bigr\}\bigr|={\mathcal{O}}\bigl(N^{-1}\bigr), provided that d≥5d\geq5 and the fourth moment of XX exists. Furthermore, we provide explicit bounds of order O(N−1){\mathcal{O}}(N^{-1}) for ΔNΔ_N for the rate of approximation by short asymptotic expansions and for the concentration functions of the random variables Q[SN+a]\mathbb{Q}[S_N+a], a∈Rda\in{\mathbb{R}}^d. The order of the bound is optimal. It extends previous results of Bentkus and Götze [Probab. Theory Related Fields 109 (1997a) 367-416] (for d≥9{d\ge9}) to the case d≥5d\ge5, which is the smallest possible dimension for such a bound. Moreover, we show that, in the finite dimensional case and for isometric Q\mathbb{Q}, the implied constant in O(N−1){\mathcal{O}}(N^{-1}) has the form cdσd(det⁡C)−1/2E∥C−1/2X∥4c_dσ^d(\det\mathbb{C})^{-1/2}\mathbf {E}\|\mathbb{C}^{-1/2}X\|^4 with some cdc_d depending on dd only. This answers a long standing question about optimal rates in the central limit theorem for quadratic forms starting with a seminal paper by Esséen [Acta Math. 77 (1945) 1-125].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.