Related papers: Stein's Method and Minimum Parsimony Distance afte…
Our work is motivated by Bourque and Pevzner's (2002) simulation study of the effectiveness of the parsimony method in studying genome rearrangement, and leads to a surprising result about the random transposition walk on the group of…
Stein's method of exchangeable pairs is examined through five examples in relation to Poisson and normal distribution approximation. In particular, in the case where the exchangeable pair is constructed from a reversible Markov chain, we…
New lower bounds on the total variation distance between the distribution of a sum of independent Bernoulli random variables and the Poisson random variable (with the same mean) are derived via the Chen-Stein method. The new bounds rely on…
Stein's (1972) method is a very general tool for assessing the quality of approximation of the distribution of a random element by another, often simpler, distribution. In applications of Stein's method, one needs to establish a Stein…
We study deformations of the Plancherel measure of the symmetric group by lifting them to the symmetric group and using combinatorics of card shuffling. The existing methods for analyzing deformations of Plancherel measure are not obviously…
We provide a general steady-state diffusion approximation result which bounds the Wasserstein distance between the reversible measure $\mu$ of a diffusion process and the measure $\nu$ of an approximating Markov chain. Our result is…
We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…
Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term 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…
In this article, we obtain, for the total variance distance, the error bounds between Poisson and convolution of power series distributions via Stein's method. This provides a unified approach to many known discrete distributions. Several…
Random events in space and time often exhibit a locally dependent structure. When the events are very rare and dependent structure is not too complicated, various studies in the literature have shown that Poisson and compound Poisson…
We show by a surprisingly simple argument that the exchangeability condition, which is key to the exchangeable pair approach in Stein's method for distributional approximation, can be omitted in many standard settings. This is achieved by…
We prove a Poisson limit theorem in the total variation distance of functionals of a general Poisson point process using the Malliavin-Stein method. Our estimates only involve first and second order difference operators and are closely…
This paper studies statistics of riffle shuffles by relating them to random word statistics with the use of inverse shuffles. Asymptotic normality of the number of descents and inversions in riffle shuffles with convergence rates of order…
The framework of Stein's method for Poisson process approximation is presented from the point of view of Palm theory, which is used to construct Stein identities and define local dependence. A general result (Theorem…
In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These…
This survey article discusses the main concepts and techniques of Stein's method for distributional approximation by the normal, Poisson, exponential, and geometric distributions, and also its relation to concentration inequalities. The…
Consider a uniformly chosen random reduced decomposition of the longest element in the symmetric group. It is known that the location of the first transposition in this decomposition converges to the semicircle distribution. In this note we…
In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random transpositions card shuffle. His techniques…
We use Stein's method to establish the rates of normal approximation in terms of the total variation distance for a large class of sums of score functions of marked Poisson point processes on $\mathbb{R}^d$. As in the study under the weaker…