Hostname: page-component-76fb5796d-dfsvx Total loading time: 0 Render date: 2024-04-26T13:19:33.470Z Has data issue: false hasContentIssue false

Improved Chen‒Stein bounds on the probability of a union

Published online by Cambridge University Press:  09 December 2016

Sheldon M. Ross*
Affiliation:
University of Southern California
*
* Postal address: Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089, USA. Email address: smross@usc.edu

Abstract

We improve the Chen‒Stein bounds when applied to the probability of a union. When the probability is small, the improvement in the distance from the lower to the upper bound is roughly a factor of 2. Further improvements are determined when the events of the union are either negatively or positively dependent.

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 2016 

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.)

References

[1] Barbour, A. D.,Holst, L. and Janson, S. (1992).Poisson Approximations.Oxford University Press.Google Scholar
[2] Block, H. W.,Savits, T. H. and Shaked, M. (1982).Some concepts of negative dependence.Ann. Prob. 10,765772.CrossRefGoogle Scholar
[3] Chen, L. H. Y. (1975).Poisson approximations for dependent trials.Ann. Prob. 3,534545.Google Scholar
[4] Cohen, A. and Sackrowitz, H. B. (1994).Association and unbiased tests in statistics.In Stochastic Orders and Their Applications,Academic Press,Boston, MA,pp. 251274.Google Scholar
[5] Janson, S. (1998).New versions of Suen's correlation inequality.Random Structures Algorithms 13,467483.Google Scholar
[6] Mallows, C. (1968).An inequality involving multinomial probabilities.Biometrika 55,422424.Google Scholar
[7] Ross, S. M. (2002).Probability Models for Computer Science.Academic Press,San Diego, CA.Google Scholar
[8] Suen, W.-C. S. (1990).A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph.Random Structures Algorithms 1,231242.CrossRefGoogle Scholar