A generalization of Hunter's bound to hypergraphs

DOI10.1007/S10479-018-2869-0MaRDI QIDQ6880170zbMATH OpenFDO

Authors Gergely Kovács, B. Vizvári

Publication date 19 December 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-018-2869-0

zbMATH Keywords

Hunter's boundlower and upper boundprobability of union of events

Mathematics Subject Classification ID

Combinatorial probability (60Cxx) Distribution theory (60Exx) Mathematical programming (90Cxx)

Cites work

• An upper bound for the probability of a union
• Best Possible Inequalities for the Probability of a Logical Function of Events
• Boole-Bonferroni Inequalities and Linear Programming
• Bounding the probability of the union of events by aggregation and disaggregation in linear programs
• Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
• Computing bounds for the probability of the union of events by different methods
• scientific article; zbMATH DE number 3751684 (Why is no real title available?)
• scientific article; zbMATH DE number 1261204 (Why is no real title available?)
• scientific article; zbMATH DE number 3076638 (Why is no real title available?)
• Hypermultitrees and sharp Bonferroni inequalities
• Inequalities for the probability of the occurrence of at least m out of n events
• Inequalities on expectations based on the knowledge of multivariate moments
• Optimality conditions for Hunter's bound
• Sharp Bounds on Probabilities Using Linear Programming
• Strengthened bounds for the probability of \(k\)-out-of-\(n\) events

This page was built for publication: A generalization of Hunter's bound to hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880170)