Lower Bounds for the Probability of a Union via Chordal Graphs

Abstract

We establish new Bonferroni-type lower bounds for the probability of a union of finitely many events where the selection of intersections in the estimates is determined by the clique complex of a chordal graph.

arXiv comment5 pages, 1 figure

Cited by in corpus (2)

• Estimating the Number of Connected Components in a Graph via Subgraph Sampling
• A nested hierarchy of second order upper bounds on system failure probability