A Short Survey on Bounding the Union Probability using Partial Information

October 20, 2017 Β· The Cartographer Β· πŸ› arXiv.org

πŸ“š THE CARTOGRAPHER: The Cartographer
Survey/review paper β€” maps the landscape rather than implementing a method.

"No code URL or promise found in abstract"
"Title-pattern auto-detect: A Short Survey on Bounding the Union Probability using Partial Information"

Evidence collected by the PWNC Scanner

Authors Jun Yang, Fady Alajaji, Glen Takahara arXiv ID 1710.07576 Category math.PR Cross-listed cs.IT Citations 3 Venue arXiv.org Last Checked 4 days ago
Abstract
This is a short survey on existing upper and lower bounds on the probability of the union of a finite number of events using partial information given in terms of the individual or pairwise event probabilities (or their sums). New proofs for some of the existing bounds are provided and new observations regarding the existing Gallot--Kounias bound are given.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.PR