SearcharxivSearch

arXiv · 2609.07066

Optimal Sobolev Rate for Gaussian Density Approximation of Wiener Chaos Vectors

Abstract

Let $(F_n)$ be a sequence of random vectors with identity covariance matrix whose components belong to the same fixed Wiener chaos, and assume that $F_n$ converges in law to a standard Gaussian vector. We prove that, for every integer $m\geq0$ and every $p\in[1,\infty]$, the optimal rate of convergence of the densities in the Sobolev space $W^{m,p}$ is given by the maximum of the absolute third-order cumulants and the diagonal fourth-order cumulants. The same quantity also gives the optimal rates in total variation, Kolmogorov and $1$-Wasserstein distances. Our proof first derives, by Gaussian interpolation and Gaussian convolution, a cumulant expansion in the space of tempered distributions without imposing Malliavin nondegeneracy at the endpoint. Finite-order Malliavin density estimates then upgrade this identity to Sobolev spaces. Matching lower bounds follow from a finite-dimensional argument in which parity separates the third-order and fourth-order Gaussian corrections, while norm equivalence rules out cancellations among mixed cumulants. A superconvergence theorem supplies the required finite negative moments of the Malliavin determinant along a sufficiently far tail of the approximating sequence, so that no Malliavin nondegeneracy assumption is required.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Huiping Chen, Yong Chen, Yong Liu. 2026-09-07. Optimal Sobolev Rate for Gaussian Density Approximation of Wiener Chaos Vectors. https://arxiv.org/abs/2609.07066

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR