SearcharxivSearch

arXiv · 2608.01081

The Optimal Rate in the Averaged Random-Marginal Central Limit Theorem for Log-Concave Measures

Abstract

Let $X$ be a centered isotropic log-concave random vector in $\mathbb{R}^n$. For $\theta\in S^{n-1}$, let $\mu_\theta$ be the law of $\langle X,\theta\rangle$, and let $\Theta$ be uniformly distributed on $S^{n-1}$, independently of $X$. We prove the sharp estimate \[ \textsf{E} W_1(\mu_\Theta,\gamma_1) \le \frac{C}{n}. \] Here the Wasserstein distance is computed after the direction is fixed and is then averaged over the sphere. No symmetry assumption is imposed. A product measure with centered exponential coordinates gives a matching lower bound of order $n^{-1}$. The proof separates the averaged-direction law from the fluctuation among fixed directions. For the first part, a Taylor expansion in the random radius retains a mean-zero cancellation and yields an $O(n^{-1})$ error. For the second, a weighted $L^2$ distance between distribution functions is converted into an exact spherical kernel depending only on $|x|^2$, $|y|^2$, and $\langle x,y\rangle$. Expanding this kernel in $\langle x,y\rangle$, we control its linear, quadratic, and cubic terms using the quadratic variance inequality $\operatorname{Var}(X^\top M X) \le 8\operatorname{Tr}(M^2)$, while fixed-order moment estimates control the remainder.

Explore related subjects

Keep this discovery

BibTeXRIS

Xuanang Hu. 2026-08-02. The Optimal Rate in the Averaged Random-Marginal Central Limit Theorem for Log-Concave Measures. https://arxiv.org/abs/2608.01081

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