Related papers: Mod-Poisson approximation schemes and higher-order…
Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…
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…
In this paper, we have established a new framework of truncated inverse sampling for estimating mean values of non-negative random variables such as binomial, Poisson, hyper-geometrical, and bounded variables. We have derived explicit…
We establish a quantitative normal approximation result for sums of random variables with multilevel local dependencies. As a corollary, we obtain a quantitative normal approximation result for linear functionals of random fields which may…
The sum of symmetric Markov dependent three-point random variables is approximated by the difference of two independent Poisson random variables (Skellam random variable). The accuracy is estimated in local, total variation and Wasserstein…
In this paper, a new method based on probability generating functions is used to obtain multiple Stein operators for various random variables closely related to Poisson, binomial and negative binomial distributions. Also, Stein operators…
The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the…
In this paper, we are concerned with obtaining distribution-free concentration inequalities for mixture of independent Bernoulli variables that incorporate a notion of variance. Missing mass is the total probability mass associated to the…
Using coupling techniques based on Stein's method for probability approximation, we revisit classical variance bounding inequalities of Chernoff, Cacoullos, Chen and Klaassen. Taking advantage of modern coupling techniques allows us to…
Consider a central problem in randomized approximation schemes that use a Monte Carlo approach. Given a sequence of independent, identically distributed random variables $X_1,X_2,\ldots$ with mean $\mu$ and standard deviation at most $c…
How much dependence is there in the prime factorization of a random integer distributed uniformly from 1 to n? How much dependence is there in the decomposition into cycles of a random permutation of n points? What is the relation between…
For a family of probability functions (or a probability kernel), cross modality occurs when every likelihood maximum matches a mode of the distribution. This implies existence of simultaneous maxima on the modal ridge of the family. The…
A refinement of so-called fast Johnson-Lindenstrauss transform, due to Ailon and Chazelle (2006), and Matou\v{s}ek (2008), is proposed. While it preserves the time efficiency and simplicity of implementation of the original construction, it…
We extend a general Bernstein-type maximal inequality of Kevei and Mason (2011) for sums of random variables.
A refinement of Bennett's inequality is introduced which is strictly tighter than the classical bound. The new bound establishes the convergence of the average of independent random variables to its expected value. It also carefully…
We consider square-integrable functionals of Poisson point processes for which the variance upper bound provided by the classical Poincar\'{e} inequality is suboptimal, a phenomenon known as superconcentration. In this paper, we establish a…
In this paper we produce precise large deviation estimates through the lens of mod-Poisson convergence. We apply a general result to various examples from number theory, Dedekind domains and polynomials over finite fields when an element is…
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…
Local meshless methods obtain higher convergence rates when RBF approximations are augmented with monomials up to a given order. If the order of the approximation method is spatially variable, the numerical solution is said to be p-refined.…
We introduce a nonasymptotic framework for sub-Poisson distributions with moment generating function dominated by that of a Poisson distribution. At its core is a new notion of optimal sub-Poisson variance proxy, analogous to the variance…