Graph-based upper bounds for the probability of the union of events
From MaRDI portal
(Redirected from Publication:1010734)
Recommendations
- New upper bounds on the probability of events based on graph structures
- Upper bounds of degree 3 for the probability of the union of events via linear programming
- Complexity of some graph-based bounds on the probability of a union of events
- Improved bounds on the probability of the union of events some of whose intersections are empty
- scientific article; zbMATH DE number 1724439
Cited in
(12)- New Bounds of the Probability of a Union
- On bounding the union probability using partial weighted information
- Computing bounds for the probability of the union of events by different methods
- Tight Probability Bounds with Pairwise Independence
- Lower bounds for the probability of a union via chordal graphs
- Polynomially computable bounds for the probability of the union of events
- Union-free hypergraphs and probability theory
- Upper bounds of degree 3 for the probability of the union of events via linear programming
- New upper bounds on the probability of events based on graph structures
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
- Complexity of some graph-based bounds on the probability of a union of events
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
This page was built for publication: Graph-based upper bounds for the probability of the union of events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010734)
