Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T01:04:46.314Z Has data issue: false hasContentIssue false

An upper bound for the probability of a union

Published online by Cambridge University Press:  14 July 2016

David Hunter*
Affiliation:
IBM Research Laboratory, San Jose, California

Abstract

The problem of bounding P(∪ Ai ) given P(A i) and P(A i A j) for i ≠ j = 1, …, k goes back to Boole (1854) and Bonferroni (1936). In this paper a new family of upper bounds is derived using results in graph theory. This family contains the bound of Kounias (1968), and the smallest upper bound in the family for a given application is easily derivable via the minimal spanning tree algorithm of Kruskal (1956). The properties of the algorithm and of the multivariate normal and t distributions are shown to provide considerable simplifications when approximating tail probabilities of maxima from these distributions.

Information

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1976 

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

Article purchase

Temporarily unavailable