Compound poisson approximation via information functionals

30Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

An information-theoretic development is given for the problem of compound Poisson approximation, which parallels earlier treatments for Gaussian and Poisson approximation. Nonasymptotic bounds are derived for the distance between the distribution of a sum of independent integervalued random variables and an appropriately chosen compound Poisson law. In the case where all summands have the same conditional distribution given that they are non-zero, a bound on the relative entropy distance between their sum and the compound Poisson distribution is derived, based on the data-processing property of relative entropy and earlier Poisson approximation results. When the summands have arbitrary distributions, corresponding bounds are derived in terms of the total variation distance. The main technical ingredient is the introduction of two “information functionals,” and the analysis of their properties. These information functionals play a role analogous to that of the classical Fisher information in normal approximation. Detailed comparisons are made between the resulting inequalities and related bounds. © 2010 Applied Probability Trust.

Cite

CITATION STYLE

APA

Barbour, A. D., Johnson, O., Kontoyiannis, I., & Madiman, M. (2010). Compound poisson approximation via information functionals. Electronic Journal of Probability, 15, 1344–1368. https://doi.org/10.1214/EJP.v15-799

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free