Related papers: Stein's Method and Minimum Parsimony Distance afte…
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…
Rare event simulation and rare event probability estimation are important tasks within the analysis of systems subject to uncertainty and randomness. Simultaneously, accurately estimating rare event probabilities is an inherently difficult…
We provide a general theorem bounding the error in the approximation of a random measure of interest--for example, the empirical population measure of types in a Wright-Fisher model--and a Dirichlet process, which is a measure having…
We provide a general result for bounding the difference between point probabilities of integer supported distributions and the translated Poisson distribution, a convenient alternative to the discretized normal. We illustrate our theorem in…
Random measures provide flexible parameters for Bayesian nonparametric models. Given two different priors for a random measure, we develop a natural framework to investigate the rate at which the corresponding posteriors merge, as the…
Recently Wilson [Ann. Appl. Probab. 14 (2004) 274--325] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson's technique to find lower bounds of the correct order for…
In this paper we consider a random walk of a particle in $\mathbb{R}^d$. Convergence of different transformations of trajectories of random flights with Poisson switching moments has been obtained by Davydov and Konakov, as well as…
We investigate the problem of reconstructing a set $P\subseteq \mathbb{R}$ of distinct points, where the only information available about $P$ consists of the distances between some of the pairs of points. More precisely, we examine which…
We consider distributional approximation by generalized Dickman distributions, which appear in number theory, perpetuities, logarithmic combinatorial structures and many other areas. We prove bounds in the Kolmogorov distance for the…
Small subgraph counts can be used as summary statistics for large random graphs. We use the Stein-Chen method to derive Poisson approximations for the distribution of the number of subgraphs in the stochastic block model which are…
We consider $M/Ph/n+M$ queueing systems in steady state. We prove that the Wasserstein distance between the stationary distribution of the normalized system size process and that of a piecewise Ornstein-Uhlenbeck (OU) process is bounded by…
We construct a continuous family of exchangeable pairs by perturbing the random variable through diffusion processes on manifold in order to apply Stein method to certain geometric settings. We compare our perturbation by diffusion method…
In this paper we give a historical account of the development of Poisson approximation using Stein's method and present some of the main results. We give two recent applications, one on maximal arithmetic progressions and the other on…
By a method inspired of the Stein's method, we derive an upper-bound of the Rubinstein distance between two absolutely continuous probability measures on configurations space. As an application, we show that the best way to approximate a…
We study the least-energy way to reshape a probability distribution when motion is constrained to a horizontal bundle, that is, optimal transport and distribution steering in sub-Riemannian geometry, motivated by density control over…
Random permutation set (RPS) is a recently proposed framework designed to represent order-structured uncertain information. Measuring the distance between permutation mass functions is a key research topic in RPS theory (RPST). This paper…
The main purpose of the paper is to investigate the possibility of applying Chen-Stein approach to estimate the $\chi^2$ distance between Poisson distribution and a sum of independent indicators. Earlier results concerning $\chi^2$ distance…
Distance measures between graphs are important primitives for a variety of learning tasks. In this work, we describe an unsupervised, optimal transport based approach to define a distance between graphs. Our idea is to derive…
We study a diffusion approximation for a model of stochastic motion of a particle in one spatial dimension. The velocity of the particle is constant but the direction of the motion undergoes random changes with a Poisson clock. Moreover,…
This exposition explains the basic ideas of Stein's method for Poisson random variable approximation and Poisson process approximation from the point of view of the immigration-death process and Palm theory. The latter approach also enables…