General Berry-Esseen bounds are developed for the exponential distribution using Stein's method. As an application, a sharp error term is obtained for Hora's result that the spectrum of the Bernoulli-Laplace Markov chain has an exponential limit. This is the first use of Stein's method to study the spectrum of a graph with a non-normal limit.
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…
In this paper, we provide upper bounds on the d2 distance between a large class of functionals of a multivariate compound Hawkes process and a given Gaussian vector. This is proven using Malliavin's calculus defined on an underlying Poisson embedding. The upper bound is then used to infer the speed of convergence of Central Limit Theorems for the multivariate compound Hawkes process with exponential kernels as the observation time T goes to infinity.
One major obstacle in applications of Stein's method for compound Poisson approximation is the availability of so-called magic factors (bounds on the solution of the Stein equation) with favourable dependence on the parameters of the approximating compound Poisson random variable. In general, the best such bounds have an exponential dependence on these parameters, though in certain situations better bounds are available. In this paper, we extend the region for which well-behaved magic factors are available for compound Poisson approximation in the Kolmogorov metric, allowing useful compound Po…
Let $\boldsymbolξ=(ξ_1,\ldots,ξ_m)$ be a negatively associated mean zero random vector with components that obey the bound $|ξ_i| \le B, i=1,\ldots,m$, and whose sum $W = \sum_{i=1}^m ξ_i$ has variance 1, the bound \[ d_1\big({\cal L}(W),{\cal L}(Z)\big) \le 5B - 5.2\sum_{i \not = j} σ_{ij}. \] is obtained where $Z$ has the standard normal distribution and $d_1(\cdot,\cdot)$ is the $L^1$ metric. The result is extended to the multidimensional case with the $L^1$ metric replaced by a smooth functions metric. Applications to second order stationary random fields with exponential decreasing covari…
We investigate links between the so-called Stein's density approach in dimension one and some functional and concentration inequalities. We show that measures having a finite first moment and a density with connected support satisfy a weighted Poincaré inequality with the weight being the Stein kernel, that indeed exists and is unique in this case. Furthermore, we prove weighted log-Sobolev and asymmetric Brascamp-Lieb type inequalities related to Stein kernels. We also show that existence of a uniformly bounded Stein kernel is sufficient to ensure a positive Cheeger isoperimetric constant. Th…
This paper studies the f-ergodicity and its exponential convergence rate for continuous-time Markov chain. Assume f is square integrable, for reversible Markov chain, it is proved that the exponential convergence of f-ergodicity holds if and only if the spectral gap of the generator is positive. Moreover, the convergence rate is equal to the spectral gap. For irreversible case, the positivity of spectral gap remains a sufficient condition of f-ergodicity. The effectiveness of these results are illustrated by some typical examples.
We study stability of the sharp spectral gap bounds for metric-measure spaces satisfying a curvature bound. Our main result, new even in the smooth setting, is a sharp quantitative estimate showing that if the spectral gap of an RCD$(N-1, N)$ space is almost minimal, then the pushforward of the measure by an eigenfunction associated with the spectral gap is close to a Beta distribution. The proof combines estimates on the eigenfunction obtained via a new $L^1$-functional inequality for RCD spaces with Stein's method for distribution approximation. We also derive analogous, almost sharp, estima…
University of Chicago（芝加哥大学）；Toyota Technological Institute at Chicago（芝加哥丰田技术研究院）
Analyzing concentration of large random matrices is a common task in a wide variety of fields. Given independent random variables, many tools are available to analyze random matrices whose entries are linear in the variables, e.g. the matrix-Bernstein inequality. However, in many applications, we need to analyze random matrices whose entries are polynomials in the variables. These arise naturally in the analysis of spectral algorithms, e.g., Hopkins et al. [STOC 2016], Moitra-Wein [STOC 2019]; and in lower bounds for semidefinite programs based on the Sum of Squares hierarchy, e.g. Barak et al…
