Lower Bounds for the Probability of a Union via Chordal Graphs

2010/04/20 by Klaus Dohmen, Dohmen, Klaus
Computer Science · Mathematics · #Bayesian Modeling and Causal Inference #Combinatorics (math.CO) #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #Topological and Geometric Data Analysis

paper · doi:10.48550/arxiv.1004.3416

openalex publication_date 2010/04/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• On the shortest spanning subtree of a graph and the traveling salesman problem

Related

• Improved Bounds on the Probability of a Union and on the Number of Events that Occur
• A Short Survey on Bounding the Union Probability using Partial Information
• Lower Bounds on the Probability of a Finite Union of Events
• On lower and upper bounds for probabilities of unions and the Borel--Cantelli lemma
• An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line