We study the central limit theorem for sums of independent tensor powers, $\frac{1}{\sqrt{d}}\sum\limits_{i=1}^d X_i^{\otimes p}$. We focus on the high-dimensional regime where $X_i \in \mathbb{R}^n$ and $n$ may scale with $d$. Our main result is a proposed threshold for convergence. Specifically, we show that, under some regularity assumption, if $n^{2p-1}\gg d$, then the normalized sum converges to a Gaussian. The results apply, among others, to symmetric uniform log-concave measures and to product measures. This generalizes several results found in the literature.
Our main technique is a novel application of optimal transport to Stein's method which accounts for the low dimensional structure which is inherent in $X_i^{\otimes p}$.
Using the Coulomb Fluid method, this paper derives central limit theorems (CLTs) for linear spectral statistics of three "spiked" Hermitian random matrix ensembles. These include Johnstone's spiked model (i.e., central Wishart with spiked correlation), non-central Wishart with rank-one non-centrality, and a related class of non-central $F$ matrices. For a generic linear statistic, we derive simple and explicit CLT expressions as the matrix dimensions grow large. For all three ensembles under consideration, we find that the primary effect of the spike is to introduce an $O(1)$ correction term t…
This paper derives central limit theorems (CLTs) for general linear spectral statistics (LSS) of three important multi-spiked Hermitian random matrix ensembles. The first is the most common spiked scenario, proposed by Johnstone, which is a central Wishart ensemble with fixed-rank perturbation of the identity matrix, the second is a non-central Wishart ensemble with fixed-rank noncentrality parameter, and the third is a similarly defined non-central $F$ ensemble. These CLT results generalize our recent work to account for multiple spikes, which is the most common scenario met in practice. The …
We provide non-asymptotic convergence rates of the Polyak-Ruppert averaged stochastic gradient descent (SGD) to a normal random vector for a class of twice-differentiable test functions. A crucial intermediate step is proving a non-asymptotic martingale central limit theorem (CLT), i.e., establishing the rates of convergence of a multivariate martingale difference sequence to a normal random vector, which might be of independent interest. We obtain the explicit rates for the multivariate martingale CLT using a combination of Stein's method and Lindeberg's argument, which is then used in conjun…
We consider high dimensional Wishart matrices $\mathbb{X} \mathbb{X}^{\top}$ where the entries of $\mathbb{X} \in {\mathbb{R}^{n \times d}}$ are i.i.d. from a log-concave distribution. We prove an information theoretic phase transition: such matrices are close in total variation distance to the corresponding Gaussian ensemble if and only if $d$ is much larger than $n^3$. Our proof is entropy-based, making use of the chain rule for relative entropy along with the recursive structure in the definition of the Wishart ensemble. The proof crucially relies on the well known relation between Fisher i…
We introduce a new version of Stein's method that reduces a large class of normal approximation problems to variance bounding exercises, thus making a connection between central limit theorems and concentration of measure. Unlike Skorokhod embeddings, the object whose variance must be bounded has an explicit formula that makes it possible to carry out the program more easily. As an application, we derive a general CLT for functions that are obtained as combinations of many local contributions, where the definition of "local" itself depends on the data. Several examples are given, including the…
Consider the multivariate Stein equation $Δf - x\cdot \nabla f = h(x) - E h(Z)$, where $Z$ is a standard $d$-dimensional Gaussian random vector, and let $f\_h$ be the solution given by Barbour's generator approach. We prove that, when $h$ is $α$-Hölder ($0<α\leq1$), all derivatives of order $2$ of $f\_h$ are $α$-Hölder {\it up to a $\log$ factor}; in particular they are $β$-Hölder for all $β\in (0, α)$, hereby improving existing regularity results on the solution of the multivariate Gaussian Stein equation. For $α=1$, the regularity we obtain is optimal, as shown by an example given by Raič \c…
We consider the problem of optimal transportation with general cost between a empirical measure and a general target probability on R d , with d $\ge$ 1. We extend results in [19] and prove asymptotic stability of both optimal transport maps and potentials for a large class of costs in R d. We derive a central limit theorem (CLT) towards a Gaussian distribution for the empirical transportation cost under minimal assumptions, with a new proof based on the Efron-Stein inequality and on the sequential compactness of the closed unit ball in L 2 (P) for the weak topology. We provide also CLTs for e…
We use a multivariate version of Stein's method to establish a quantitative Lindeberg CLT for the Fourier transforms of random $N$-vectors. We achieve this by deducing a specific integral representation for the Hessian matrix of a solution to the Stein equation with test function $e_t(x) = \exp(- i \sum_{k=1}^N t_k x_k)$, where $t,x \in \mathbb{R}^N$.
We use Stein's method to prove a generalization of the Lindeberg-Feller CLT providing an upper and a lower bound for the superior limit of the Kolmogorov distance between a normally distributed random variable and the rowwise sums of a rowwise independent triangular array of random variables which is asymptotically negligible in the sense of Feller. A natural example shows that the upper bound is of optimal order. The lower bound improves a result by Andrew Barbour and Peter Hall.
A law of large numbers and a central limit theorem are derived for linear statistics of random symmetric matrices whose on-or-above diagonal entries are independent, but neither necessarily identically distributed, nor necessarily all of the same variance. The derivation is based on systematic combinatorial enumeration, study of generating functions, and concentration inequalities of the Poincare type. Special cases treated, with an explicit evaluation of limiting variances, are generalized Wigner and Wishart matrices.
Let $M_n$ be a random element of the unitary, special orthogonal, or unitary symplectic groups, distributed according to Haar measure. By a classical result of Diaconis and Shahshahani, for large matrix size $n$, the vector $ (\on{Tr}(M_n), \on{Tr}(M_n^2),..., \on{Tr}(M_n^d))$ tends to a vector of independent (real or complex) Gaussian random variables. Recently, Jason Fulman has demonstrated that for a single power $j$ (which may grow with $n$), a speed of convergence result may be obtained via Stein's method of exchangeable pairs. In this note, we extend Fulman's result to the multivariate c…
This paper is concerned with the Stein's method associated with a (possibly) asymmetric $α$-stable distribution $Z$, in dimension one. More precisely, its goal is twofold. In the first part, we exhibit a genuine bound for the Wasserstein distance between $Z$ and any integrable random variable $X$, in terms of an operator that reduces to the classical fractional Laplacian in the symmetric case. Then, in the second part we apply the aforementioned bound to compute error rates in the stable central limit theorem, when the entries are in the domain $\mathcal{D}_α$ of normal attraction of a stable …
We introduce higher-order Stein kernels relative to the standard Gaussian measure, which generalize the usual Stein kernels by involving higher-order derivatives of test functions. We relate the associated discrepancies to various metrics on the space of probability measures and prove new functional inequalities involving them. As an application, we obtain new explicit improved rates of convergence in the classical multidimensional CLT under higher moment and regularity assumptions.
This paper is concerned with normal approximation under relaxed moment conditions using Stein's method. We obtain the explicit rates of convergence in the central limit theorem for (i) nonlinear statistics with finite absolute moment of order $2+δ\in(2,3];$ (ii) nonlinear statistics with vanishing third moment and finite absolute moment of order $3+δ\in(3,4].$ When applied to specific examples, these rates are of the optimal order $O(n^{-\fracδ{2}})$ and $O(n^{-\frac{1+δ}{2}}).$ Our proof are based on the covariance identify formula and simple observations about the solution of Stein's equatio…
We investigate the multivariate central limit theorem for nonlinear statistics by means of Stein's method and Slepian's smart path interpolation method. Based on certain difference operators in theory of concentration inequalities, we obtain two explicit bounds for the rate of convergence. Applications to Rademacher functionals, the runs and quadratic forms are provided as well.
We establish existence of Stein kernels for probability measures on $\mathbb{R}^d$ satisfying a Poincaré inequality, and obtain bounds on the Stein discrepancy of such measures. Applications to quantitative central limit theorems are discussed, including a new CLT in Wasserstein distance $W_2$ with optimal rate and dependence on the dimension. As a byproduct, we obtain a stability version of an estimate of the Poincaré constant of probability measures under a second moment constraint. The results extend more generally to the setting of converse weighted Poincaré inequalities. The proof is base…
We derive explicit Berry-Esseen bounds in the total variation distance for the Breuer-Major central limit theorem, in the case of a subordinating function $φ$ satisfying minimal regularity assumptions. Our approach is based on the combination of the Malliavin-Stein approach for normal approximations with Gebelein's inequality, bounding the covariance of functionals of Gaussian fields in terms of maximal correlation coefficients.
We compute explicit bounds in the Gaussian approximation of functionals of infinite Rademacher sequences. Our tools involve Stein's method, as well as the use of appropriate discrete Malliavin operators. Although our approach does not require the classical use of exchangeable pairs, we employ a chaos expansion in order to construct an explicit exchangeable pair vector for any random variable which depends on a finite set of Rademacher variables. Among several examples, which include random variables which depend on infinitely many Rademacher variables, we provide three main applications: (i) t…
We extend Stein's celebrated Wasserstein bound for normal approximation via exchangeable pairs to the multi-dimensional setting. As an intermediate step, we exploit the symmetry of exchangeable pairs to obtain an error bound for smooth test functions. We also obtain a continuous version of the multi-dimensional Wasserstein bound in terms of fourth moments. We apply the main results to multivariate normal approximations to Wishart matrices of size $n$ and degree $d$, where we obtain the optimal convergence rate $\sqrt{n^3/d}$ under only moment assumptions, and to quadratic forms and Poisson fun…
Let $\{G_n: n\geq 1\}$ be a sequence of simple graphs. Suppose $G_n$ has $m_n$ edges and each vertex of $G_n$ is colored independently and uniformly at random with $c_n$ colors. Recently, Bhattacharya, Diaconis and Mukherjee (2013) proved universal limit theorems for the number of monochromatic edges in $G_n$. Their proof was by the method of moments, and therefore was not able to produce rates of convergence. By a non-trivial application of Stein's method, we prove that there exists a universal error bound for their central limit theorem. The error bound depends only on $m_n$ and $c_n$, regar…
One of the remarkable applications of the cavity method is to prove the Thouless-Anderson-Palmer (TAP) system of equations in the high temperature regime of the Sherrington-Kirkpatrick (SK) model. This naturally leads us to the important study of the limit laws for cavity and local fields. The first quantitative results for both fields based on Stein's method were studied by Chatterjee. Although Stein's method provides us an efficient approach for obtaining the limiting distributions, the nature of this method restricts the derivation of optimal and general results. In this paper, our study ba…
In this note, we study the Gaussian fluctuations for the Wishart matrices $d^{-1}\mathcal{X}_{n, d}\mathcal{X}^{T}_{n, d}$, where $\mathcal{X}_{n, d}$ is a $n\times d$ random matrix whose entries are jointly Gaussian and correlated with row and column covariance functions given by $r$ and $s$ respectively such that $r(0)=s(0)=1$. Under the assumptions $s\in \ell^{4/3}(\mathbb{Z})$ and $\|r\|_{\ell^1(\mathbb{Z})}< \sqrt{6}/2$, we establish the $\sqrt{n^3/d}$ convergence rate for the Wasserstein distance between a normalization of $d^{-1}\mathcal{X}_{n, d}\mathcal{X}^{T}_{n, d}$ and the correspo…
In this paper, we develop a stochastic algorithm based on the Euler--Maruyama scheme to approximate the invariant measure of the limiting multidimensional diffusion of $G/Ph/n+GI$ queues in the Halfin-Whitt regime. Specifically, we prove a non-asymptotic error bound between the invariant measures of the approximate model from the algorithm and the limiting diffusion. To establish the error bound, we employ the recently developed Stein's method for multi-dimensional diffusions, in which the regularity of Stein's equation developed by Gurvich (2014, 2022) plays a crucial role. We further prove t…
In this paper, we develop a stochastic algorithm based on Euler-Maruyama scheme to approximate the invariant measure of the limiting multidimensional diffusion of the $M/Ph/n+M$ queue. Specifically, we prove a non-asymptotic error bound between the invariant measures of the approximate model from the algorithm and the limiting diffusion of the queueing model. Our result also provides an approximation to the steady-state of the diffusion-scaled queueing processes in the Halfin-Whitt regime given the well established interchange of limits property. To establish the error bound, we employ the rec…
We consider high-dimensional Wishart matrices $d^{-1}\mathcal{X}_{n,d}\mathcal{X}_{n,d}^T$, associated with a rectangular random matrix $\mathcal{X}_{n,d}$ of size $n\times d$ whose entries are jointly Gaussian and correlated. Even if we will consider the case of overall correlation among the entries of $\mathcal{X}_{n,d}$, our main focus is on the case where the rows of $\mathcal{X}_{n,d}$ are independent copies of a $n$-dimensional stationary centered Gaussian vector of correlation function $s$. When $s$ belongs to $\ell^{4/3}(\mathbb{Z})$, we show that a proper normalization of $d^{-1}\math…
We study dynamical systems arising as time-dependent compositions of Pomeau-Manneville-type intermittent maps. We establish central limit theorems for appropriately scaled and centered Birkhoff-like partial sums, with estimates on the rate of convergence. For maps chosen from a certain parameter range, but without additional assumptions on how the maps vary with time, we obtain a self-normalized CLT provided that the variances of the partial sums grow sufficiently fast. When the maps are chosen randomly according to a shift-invariant probability measure, we identify conditions under which the …
It is known that the fluctuations of suitable linear statistics of Haar distributed elements of the compact classical groups satisfy a central limit theorem. We show that if the corresponding test functions are sufficiently smooth, a rate of convergence of order almost $1/n$ can be obtained using a quantitative multivariate CLT for traces of powers that was recently proven using Stein's method of exchangeable pairs.
Linear statistics of eigenvalues in many familiar classes of random matrices are known to obey gaussian central limit theorems. The proofs of such results are usually rather difficult, involving hard computations specific to the model in question. In this article we attempt to formulate a unified technique for deriving such results via relatively soft arguments. In the process, we introduce a notion of `second order Poincaré inequalities': just as ordinary Poincaré inequalities give variance bounds, second order Poincaré inequalities give central limit theorems. The proof of the main result em…
In this paper, we study the spatial averages of the solution to the parabolic Anderson model driven by a space-time Gaussian homogeneous noise that is colored in time and space. We establish quantitative central limit theorems (CLT) of this spatial statistics under some mild assumptions, by using the Malliavin-Stein approach. The highlight of this paper is the obtention of rate of convergence in the colored-in-time setting, where one can not use Itô's calculus due to the lack of martingale structure. In particular, modulo highly technical computations, we apply a modified version of second-ord…
Consider random symmetric Toeplitz matrices $T_{n}=(a_{i-j})_{i,j=1}^{n}$ with matrix entries $a_{j}, j=0,1,2,...,$ being independent real random variables such that \be \mathbb{E}[a_{j}]=0, \ \ \mathbb{E}[|a_{j}|^{2}]=1 \ \ \textrm{for}\,\ \ j=0,1,2,...,\ee (homogeneity of 4-th moments) \be{κ=\mathbb{E}[|a_{j}|^{4}],}\ee \noindent and further (uniform boundedness)\be\sup\limits_{j\geq 0} \mathbb{E}[|a_{j}|^{k}]=C_{k}<\iy\ \ \ \textrm{for} \ \ \ k\geq 3.\ee Under the assumption of $a_{0}\equiv 0$, we prove a central limit theorem for linear statistics of eigenvalues for a fixed polynomial with…
