Graph-Based Upper Bounds for the Probability of the Union of Events

Thumbnail
Name:
mth_facpub/8/fulltext (1).pdf
Size:
127.1Kb
Format:
PDF
Download
Cast your vote
 
Your vote was cast
Thank you for your feedback
Author
Veneziani, Pierangela
Journal title
Electronic Journal of Combinatorics
Date Published
2008-02-01
Publication Volume
15
Publication Issue
1

Metadata
Show full item record
URI
http://hdl.handle.net/20.500.12648/2611
Abstract
We consider the problem of generating upper bounds for the probability of the union of events when the individual probabilities of the events as well as the probabilities of pairs of these events are known. By formulating the problem as a Linear Program, we can obtain bounds as objective function values corresponding to dual basic feasible solutions. The new upper bounds are based on underlying bipartite and threshold type graph structures.
Citation
Veneziani, P. (2008). Graph-Based Upper Bounds for the Probability of the Union of Events. Electronic Journal of Combinatorics, 15(1R), 1-11.
Description
First published in Electronic Journal of Combinatorics in 2008, published by the American Mathematical Society
Collections