ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Discrete Mathematics
Volume 215, Issues 1-3, 28 March 2000, Pages 147-158
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (92 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0012-365X(99)00246-0    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2000 Elsevier Science B.V. All rights reserved.

A lower bound on the probability of a finite union of events*1

H. Kuai, F. AlajajiCorresponding Author Contact Information, E-mail The Corresponding Author and G. Takahara

Department of Mathematics and Statistics, Queen's University, Kingston, Ont., Canada K7L 3N6

Received 18 March 1998;
revised 25 January 1999;
accepted 17 May 1999.
Available online 23 March 2000.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

A new lower bound on the probability P(A1union or logical sumcdots, three dots, centeredunion or logical sumAN) is established in terms of only the individual event probabilities P(Ai)'s and the pairwise event probabilities P(AiAj)'s. This bound is shown to be always at least as good as two similar lower bounds: one by de Caen (1997) and the other by Dawson and Sankoff (1967). Numerical examples for the computation of this inequality are also provided.

*1 This work was supported in part by NSERC and TRIO of Canada.

Corresponding Author Contact Information Corresponding author; email: fady@polya.mast.queensu.ca


Discrete Mathematics
Volume 215, Issues 1-3, 28 March 2000, Pages 147-158
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.