Hostname: page-component-8448b6f56d-jr42d Total loading time: 0 Render date: 2024-04-23T12:52:43.777Z Has data issue: false hasContentIssue false
  • English
  • Français

Solving the Stein Equation in compound poisson approximation

Part of: Distribution theory Limit theorems

Published online by Cambridge University Press:  01 July 2016

A. D. Barbour  and
Sergey Utev
A. D. Barbour*
Affiliation:
Universität Zürich
Sergey Utev*
Affiliation:
La Trobe University and Novosibirsk University
*
∗ Postal address: Abteilung für Angewandte Mathematik, Universität Zürich-Irchel, Winterthurerstrasse 190, CH 8057 Zürich, Switzerland. Email address: adb@amath.unizh.ch
∗∗ Postal address: (1) School of Statistical Science, La Trobe University, Bundoora, Melbourne, Vic. 3083, Australia, (2) Institute of Mathematics, Novosibirsk University.
Get access Rights & Permissions [Opens in a new window]

Abstract

The accuracy of compound Poisson approximation can be estimated using Stein's method in terms of quantities similar to those which must be calculated for Poisson approximation. However, the solutions of the relevant Stein equation may, in general, grow exponentially fast with the mean number of ‘clumps’, leading to many applications in which the bounds are of little use. In this paper, we introduce a method for circumventing this difficulty. We establish good bounds for those solutions of the Stein equation which are needed to measure the accuracy of approximation with respect to Kolmogorov distance, but only in a restricted range of the argument. The restriction on the range is then compensated by a truncation argument. Examples are given to show that the method clearly outperforms its competitors, as soon as the mean number of clumps is even moderately large.

Keywords

Stein's methodcompound Poissondistributional approximation

MSC classification

Primary: 62E17: Approximations to distributions (nonasymptotic)
Secondary: 60F05: Central limit and other weak theorems
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 30 , Issue 2 , June 1998 , pp. 449 - 475
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Supported in part by Schweizerischer Nationalfonds Projekte Nr. 20-31262.91 and 21-37354.93.

References

Aldous, D. J. (1989). Probability approximations via the Poisson clumping heuristic. Springer, New York.CrossRefGoogle Scholar
Arratia, R., Goldstein, L. and Gordon, L. (1990). Poisson approximation and the Chen–Stein method. Stat. Science 5, 403–434.Google Scholar
Barbour, A. D. (1997). Stein's method. In Encyclopaedia of Statistical Science Update, Vol. 1, eds Kotz, S., Read, C. B., Banks, D. L.. Wiley, New York.Google Scholar
Barbour, A. D. and Brown, T. C. (1992). Stein's method and point process approximation. Stoch. Proc. Appl. 43, 9–31.Google Scholar
Barbour, A. D., Chen, L. H. Y. and Loh, W.-L. (1992a). Compound Poisson approximation for nonnegative random variables using Stein's method. Ann. Prob. 20, 1843–1866.CrossRefGoogle Scholar
Barbour, A. D., Holst, L. and Janson, S. (1992b). Poisson Approximation. Oxford University Press.CrossRefGoogle Scholar
Bollobás, B., (1985). Random Graphs. Academic Press, London.Google Scholar
Brown, T. C. and Xia, A. (1995). On Stein–Chen factors for Poisson approximation. Stat. Prob. Lett. 23, 327–332.CrossRefGoogle Scholar
Michel, R. (1988). An improved error bound for the compound Poisson approximation of a nearly homogeneous portfolio. ASTIN Bull. 17, 165–169.CrossRefGoogle Scholar
Roos, M. (1993). Stein–Chen method for compound Poisson approximation. , University of Zürich.Google Scholar
Roos, M. (1994). Stein's method for compound Poisson approximation: the local approach. Ann. Appl. Prob. 4, 1177–1187.Google Scholar
Roos, M. and Stark, D. (1996). Compound Poisson approximation for visits to small sets in a Markov chain. Preprint.Google Scholar
Zaitsev, A. Yu. (1988). On the uniform approximation of distributions of sums of independent random variables. Theory Prob. Appl. 32, 40–48.Google Scholar