Thumbnail Image
Publication

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

Journal Title
Electronic Journal of Combinatorics
Keywords
Readers/Advisors
Journal Title
Term and Year
Publication Date
2008-02-01
Book Title
Publication Volume
15
Publication Issue
1
Publication Begin
Publication End
Number of pages
Collections
Brockport Mathematics Faculty Publications
Show all metadata
Files
Thumbnail Image
mth_facpub/8/fulltext (1).pdf
Adobe PDF, 127.16 KB
Research Projects
Organizational Units
Journal Issue
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.
DOI
Description
First published in Electronic Journal of Combinatorics in 2008, published by the American Mathematical Society
Accessibility Statement
Embedded videos