Related papers: Stone's theorem for distributional regression in W…
We introduce a test for the conditional independence of random variables $X$ and $Y$ given a random variable $Z$, specifically by sampling from the joint distribution $(X,Y,Z)$, binning the support of the distribution of $Z$, and conducting…
Motivated by a theorem of Barbour, we revisit some of the classical limit theorems in probability from the viewpoint of the Stein method. We setup the framework to bound Wasserstein distances between some distributions on infinite…
Statistical inference can be performed by minimizing, over the parameter space, the Wasserstein distance between model distributions and the empirical distribution of the data. We study asymptotic properties of such minimum Wasserstein…
Distributional transformations characterized by equations relating expectations of test functions weighted by a given biasing function on the original distribution to expectations of the test function's higher derivatives with respect to…
We study the approximation of a (finite) continuous-time Markov chain by a Markov chain on a reduced state space, and we provide formal error bounds for the approximated transient distributions in the Wasserstein distance. These bounds…
By a delicate analysis for the Stein's equation associated to the $\alpha$-stable law approximation with $\alpha \in (0,2)$, we prove a quantitative stable central limit theorem in Wasserstein type distance, which generalizes the results in…
We study the problem of quantifying how far an empirical distribution deviates from Gaussianity under the framework of optimal transport. By exploiting the cone geometry of the relative translation invariant quadratic Wasserstein space, we…
Optimal transport is widely used to learn distributions, enforce distributional constraints, and model uncertainty. In applications, transport losses are often computed from samples through tractable representations, such as one-dimensional…
We study the accuracy of a scaled Poisson approximation to the weighted sum of independent Poisson random variables, focusing on in particular the relative error of the tail distribution. A bound on the relative approximation error is…
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
For $\ell\colon \mathbb{R}^d \to [0,\infty)$ we consider the sequence of probability measures $\left(\mu_n\right)_{n \in \mathbb{N}}$, where $\mu_n$ is determined by a density that is proportional to $\exp(-n\ell)$. We allow for infinitely…
We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…
We are interested in the approximation in Wasserstein distance with index $\rho\ge 1$ of a probability measure $\mu$ on the real line with finite moment of order $\rho$ by the empirical measure of $N$ deterministic points. The minimal error…
Many spatial models exhibit locality structures that effectively reduce their intrinsic dimensionality, enabling efficient approximation and sampling of high-dimensional distributions. However, existing approximation techniques primarily…
The Wasserstein distance, rooted in optimal transport (OT) theory, is a popular discrepancy measure between probability distributions with various applications to statistics and machine learning. Despite their rich structure and…
New bounds for the $k$-th order derivatives of the solutions of the normal and multivariate normal Stein equations are obtained. Our general order bounds involve fewer derivatives of the test function than those in the existing literature.…
We propose a new minimum-distance estimator for linear random coefficient models. This estimator integrates the recently advanced sliced Wasserstein distance with the nearest neighbor methods, both of which enhance computational efficiency.…
We suggest that the tools of contraction analysis for deterministic systems can be applied towards studying the convergence behavior of stochastic dynamical systems in the Wasserstein metric. In particular, we consider the case of Ito…
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…
We completely characterize the class of univariate distributions allowing for a Stein kernel and illustrate our result by means of some concrete distributions. Moreover, we apply our findings to prove a quantitative version of the central…