相关论文: Wasserstein-p Central Limit Theorem Rates: From Lo…

We study the long-range one-dimensional Riesz gas on the circle, a continuous system of particles interacting through a Riesz kernel. We establish near-optimal rigidity estimates on gaps valid at any scale. Leveraging these local laws…

This paper establishes the quantitative stability of invariant measures $\mu_{\alpha}$ for $\mathbb{R}^d$-valued ergodic stochastic differential equations driven by rotationally invariant multiplicative $\alpha$-stable processes with…

This paper derives non-asymptotic error bounds for nonlinear stochastic approximation algorithms in the Wasserstein-$p$ distance. To obtain explicit finite-sample guarantees for the last iterate, we develop a coupling argument that compares…

This paper deals with the rate of convergence for the central limit theorem of estimators of the drift coefficient, denoted $\theta$, for a Ornstein-Uhlenbeck process $X \coloneqq \{X_t,t\geq0\}$ observed at high frequency. We provide an…

We derive a Central Limit Theorem (CLT) for $\log \left\vert\det \left( W_{N}-E_{N}\right)\right\vert,$ where $W_{N}$ is a Wigner matrix, and $E_{N}$ is local to the edge of the semi-circle law. Precisely, $E_N=2+N^{-2/3}\sigma_N$ with…

We use a new method via $p$-Wasserstein bounds to prove Cram\'er-type moderate deviations in (multivariate) normal approximations. In the classical setting that $W$ is a standardized sum of $n$ independent and identically distributed…

Wasserstein distributionally robust optimization (WDRO) strengthens statistical learning under model uncertainty by minimizing the local worst-case risk within a prescribed ambiguity set. Although WDRO has been extensively studied in…

We prove a general normal approximation theorem for local graph statistics in the configuration model, together with an explicit bound on the error in the approximation with respect to the Wasserstein metric. Such statistics take the form…

Local dependence random graph models are a class of block models for network data which allow for dependence among edges under a local dependence assumption defined around the block structure of the network. Since being introduced by…

Consider a stationary, weakly dependent sequence of random variables. Given only mild conditions, allowing for polynomial decay of the autocovariance function, we show a Berry-Esseen bound of optimal order $n^{-1/2}$ for studentized…

Let $\{X_k\}_{k \in \mathbb{Z}}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal{H}_1$, and let $G:\mathcal{H}_1 \to \mathcal{H}_2$ be an operator acting on $X_k$. Under suitable conditions on the…

The main objective of this article is to establish a central limit theorem for additive three-variable functionals of bifurcating Markov chains. We thus extend the central limit theorem under point-wise ergodic conditions studied in…

Let $\nu\in M^1([0,\infty[)$ be a fixed probability measure. For each dimension $p\in\b N$, let $(X_n^p)_{n\ge1}$ be i.i.d. $\b R^p$-valued radial random variables with radial distribution $\nu$. We derive two central limit theorems for $…

Stochastic gradient descent (SGD) has emerged as the quintessential method in a data scientist's toolbox. Using SGD for high-stakes applications requires, however, careful quantification of the associated uncertainty. Towards that end, in…

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

In this paper, under the assumption that the dimension is much larger than the sample size, i.e., $p \asymp n^{\alpha}, \alpha>1,$ we consider the (unnormalized) sample covariance matrices $Q = \Sigma^{1/2} XX^*\Sigma^{1/2}$, where…

Central limit theorems (CLTs) have a long history in probability and statistics. They play a fundamental role in constructing valid statistical inference procedures. Over the last century, various techniques have been developed in…

Two common problems in time series analysis are the decomposition of the data stream into disjoint segments that are each in some sense "homogeneous" - a problem known as Change Point Detection (CPD) - and the grouping of similar…

Sample covariance matrix and multivariate $F$-matrix play important roles in multivariate statistical analysis. The central limit theorems {\sl (CLT)} of linear spectral statistics associated with these matrices were established in Bai and…

The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…