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

In this paper we study the almost sure central limit theorem started from a point for additive functionals of a stationary and ergodic Markov chain via a martingale approximation in the almost sure sense. As a consequence we derive the…

This paper studies the central limit theorems (CLTs) for linear spectral statistics (LSSs) of general sample covariance matrices, when the test functions belong to $C^3$, the class of functions with continuous third order derivatives. We…

The question of whether the central limit theorem (CLT) holds for the total number of edges in exponential random graph models (ERGMs) in the subcritical region of parameters has remained an open problem. In this paper, we establish the…

We investigate the problem of quantifying contraction coefficients of Markov transition kernels in Kantorovich ($L^1$ Wasserstein) distances. For diffusion processes, relatively precise quantitative bounds on contraction rates have recently…

We derive quantitative bounds on the rate of convergence in $L^1$ Wasserstein distance of general M-estimators, with an almost sharp (up to a logarithmic term) behavior in the number of observations. We focus on situations where the…

This paper proposes a new statistic to test independence between two high dimensional random vectors ${\mathbf{X}}:p_1\times1$ and ${\mathbf{Y}}:p_2\times1$. The proposed statistic is based on the sum of regularized sample canonical…

Stochastic Gradient Descent (SGD) has become a cornerstone method in modern data science. However, deploying SGD in high-stakes applications necessitates rigorous quantification of its inherent uncertainty. In this work, we establish…

We propose a novel approach to concentration for non-independent random variables. The main idea is to ``pretend'' that the random variables are independent and pay a multiplicative price measuring how far they are from actually being…

Distributionally robust control (DRC) aims to effectively manage distributional ambiguity in stochastic systems. While most existing works address inaccurate distributional information in fully observable settings, we consider a partially…

Let $P$ be a simple,stationary point process having fast decay of correlations, i.e., its correlation functions factorize up to an additive error decaying faster than any power of the separation distance. Let $P_n:= P \cap W_n$ be its…

Ferromagnetic exponential random graph models (ERGMs) are nonlinear exponential tilts of Erd\H{o}s-R\'enyi models, under which the presence of certain subgraphs such as triangles may be emphasized. These models are mixtures of metastable…

With the increasing availability of data objects in the form of probability distributions, there is a growing need for statistical methods tailored to distributional data. Distance measures, especially the pairwise distance matrix between…

Let $\mathbf{A}=\frac{1}{\sqrt{np}}(\mathbf{X}^T\mathbf{X}-p\mathbf {I}_n)$ where $\mathbf{X}$ is a $p\times n$ matrix, consisting of independent and identically distributed (i.i.d.) real random variables $X_{ij}$ with mean zero and…

The Wasserstein distance $\mathcal{W}_p$ is an important instance of an optimal transport cost. Its numerous mathematical properties as well as applications to various fields such as mathematical finance and statistics have been well…

This paper introduces ergodic-risk criteria, which capture long-term cumulative risks associated with controlled Markov chains through probabilistic limit theorems--in contrast to existing methods that require assumptions of either finite…

Let $X_1, \ldots , X_n$ be i.i.d. random vectors in $\mathbb{R}^d$ with $\|X_1\| \le \beta$. Then, we show that $\frac{1}{\sqrt{n}}(X_1 + \ldots + X_n)$ converges to a Gaussian in quadratic transportation (also known as "Kantorovich" or…

We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…

In 2010, Shiffman and Zelditch proved a central limit theorem (CLT) for smooth statistics of Gaussian random zeros in codimension one over compact K\"ahler manifolds. They raised the question of whether this result admits a two-fold…

This paper is motivated by the problem of quantitatively bounding the convergence of adaptive control methods for stochastic systems to a stationary distribution. Such bounds are useful for analyzing statistics of trajectories and…

Comparing probability distributions is at the crux of many machine learning algorithms. Maximum Mean Discrepancies (MMD) and Wasserstein distances are two classes of distances between probability distributions that have attracted abundant…