Related papers: Stein's method for discrete Gibbs measures
This paper is a short exposition of Stein's method of normal approximation from my personal perspective. It focuses mainly on the characterization of the normal distribution and the construction of Stein identities. Through examples, it…
We present discretize_distributions, a Python package that efficiently constructs discrete approximations of Gaussian mixture distributions and provides guarantees on the approximation error in Wasserstein distance. The package implements…
We develop the tools necessary to use Stein's method for approximation by a Borel distribution, which we illustrate by considering the approximation of the number of customers served in the busy period of an M/G/1 queue. We further derive…
Given a random variable $F$ regular enough in the sense of the Malliavin calculus, we are able to measure the distance between its law and almost any continuous probability law on the real line. The bounds are given in terms of the…
Motivated by its appearance as a limiting distribution for random and non-random sums of independent random variables, in this paper we develop Stein's method for approximation by the asymmetric Laplace distribution. Our results generalise…
Stein's method for measuring convergence to a continuous target distribution relies on an operator characterizing the target and Stein factor bounds on the solutions of an associated differential equation. While such operators and bounds…
For any discrete target distribution, we exploit the connection between Markov chains and Stein's method via the generator approach and express the solution of Stein's equation in terms of expected hitting time. This yields new upper bounds…
We extend Stein's method to include independence with respect to an auxiliary random variable, for any law for which a Stein characterization does exist. This extends the current literature on the problem. Using tools from the Malliavin…
We consider additive functionals of systems of random measures whose initial configuration is given by a Poisson point process, and whose individual components evolve according to arbitrary Markovian or non-Markovian measure valued…
We consider a linear Hamiltonian system consisting of a classical particle and a scalar field describing by the wave or Klein-Gordon equations with variable coefficients. The initial data of the system are supposed to be a random function…
We consider a general preferential attachment model, where the probability that a newly arriving vertex connects to an older vertex is proportional to a sublinear function of the indegree of the older vertex at that time. It is well known…
We develop Stein's method for the half-normal distribution and apply it to derive rates of convergence in distributional limit theorems for three statistics of the simple symmetric random walk: the maximum value, the number of returns to…
We show how it is possible to assess the rate of convergence in the Gaussian approximation of triangular arrays of $U$-statistics, built from wavelets coefficients evaluated on a homogeneous spherical Poisson field of arbitrary dimension.…
We consider a sequence of identically independently distributed random samples from an absolutely continuous probability measure in one dimension with unbounded density. We establish a new rate of convergence of the $\infty-$Wasserstein…
This paper proposes a novel method for testing observability in Gaussian models using discrete density approximations (deterministic samples) of (multivariate) Gaussians. Our notion of observability is defined by the existence of the…
Metrics for rigorously defining a distance between two events have been used to study the properties of the dataspace manifold of particle collider physics. The probability distribution of pairwise distances on this dataspace is unique with…
Let $Y=X_1+\cdots+X_N$ be a sum of a random number of exchangeable random variables, where the random variable $N$ is independent of the $X_j$, and the $X_j$ are from the generalized multinomial model introduced by Tallis (1962). This…
We revisit the problem of parameter estimation for discrete probability distributions with values in $\mathbb{Z}^d$. To this end, we adapt a technique called Stein's Method of Moments to discrete distributions which often gives closed-form…
The aim of this paper is to establish the uniform convergence of the densities of a sequence of random variables, which are functionals of an underlying Gaussian process, to a normal density. Precise estimates for the uniform distance are…
Stein's method is a powerful technique for proving central limit theorems in probability theory when more straightforward approaches cannot be implemented easily. This article begins with a survey of the historical development of Stein's…