Fréchet optimal bounds on the probability of a union with supplementary information
From MaRDI portal
Publication:2474522
Recommendations
- Improved bounds on the probability of the union of events some of whose intersections are empty
- Improving probability bounds by optimization over subsets
- scientific article; zbMATH DE number 3930023
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- On explicit and Fréchet-optimal lower bounds
Cites work
- scientific article; zbMATH DE number 5838699 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1409937 (Why is no real title available?)
- An Inequality for Probabilities
- Best Linear Bonferroni Bounds
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Boole-Bonferroni Inequalities and Linear Programming
- Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
- On explicit and Fréchet-optimal lower bounds
- On the history of the strong law of large numbers and Boole's inequality
- Optimal lower bounds for bivariate probabilities
Cited in
(6)- On bounding the union probability using partial weighted information
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
- A Fréchet-optimal strengthening of the Dawson-Sankoff lower bound
- Improving probability bounds by optimization over subsets
- Inequalities for discrete higher order convex functions
- The value of shape constraints in discrete moment problems: a review and extension
This page was built for publication: Fréchet optimal bounds on the probability of a union with supplementary information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474522)