Related papers: A Charlier-Parseval approach to Poisson approximat…
We overview results on the topic of Poisson approximation that are missed in existing surveys. The topic of Poisson approximation to the distribution of a sum of integer-valued random variables is presented as well. We do not restrict…
The idea behind Poisson approximation to the binomial distribution was used in [J. de la Cal, F. Luquin, J. Approx. Theory, 68(3), 1992, 322-329] and subsequent papers in order to establish the convergence of suitable sequences of positive…
It is well known that a binomial $(n,p)$ can be approximated by a Poisson distribution with parameter $np$. The typical approach in undergraduate probability texts is to show a convergence result for the distribution of the binomial as $n$…
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…
We investigate mathematically a nonlinear approximation type approach recently introduced in [A. Ammar et al., J. Non-Newtonian Fluid Mech., 2006] to solve high dimensional partial differential equations. We show the link between the…
As an application of Stein's method for Poisson approximation, we prove rates of convergence for the tail probabilities of two scan statistics that have been suggested for detecting local signals in sequences of independent random variables…
The theory of Chebyshev approximation has been extensively studied. In most cases, the optimality conditions are based on the notion of alternance or alternating sequence (that is, maximal deviation points with alternating deviation signs).…
In this paper, we consider the Poisson equation on a "long" domain which is the Cartesian product of a one-dimensional long interval with a (d-1)-dimensional domain. The right-hand side is assumed to have a rank-1 tensor structure. We will…
An approximation method is presented for probabilistic inference with continuous random variables. These problems can arise in many practical problems, in particular where there are "second order" probabilities. The approximation, based on…
The paper deals with a new approach to Poisson summation formulas in the context of function spaces on $\mathbb{R}^n$.
Multivariate Poisson approximation of the length spectrum of random surfaces is studied by means of the Chen-Stein method. This approach delivers simple and explicit error bounds in Poisson limit theorems. They are used to prove that…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
Certain monotonicity properties of the Poisson approximation to the binomial distribution are established. As a natural application of these results, exact (rather than approximate) tests of hypotheses on an unknown value of the parameter…
This note presents a fixed-point formula designed to approximate the roots of Askey-Wilson poynomials for small parameter values.
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…
One aspect of Poisson approximation is that the support of the random variable of interest is often finite while the support of the Poisson distribution is not. In this paper we will remedy this by examining truncated negative binomial (of…
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…
This is a survey paper on Poisson approximation using Stein's method of exchangeable pairs. We illustrate using Poisson-binomial trials and many variations on three classical problems of combinatorial probability: the matching problem, the…
In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of the approximating set, by defining families of…
The frequentist definition of sensitivity of a search for new phenomena proposed in arXiv:0308063 has been utilized in a number of published experimental searches. In most cases, the simple approximate formula for the common problem of…