Pages that link to "Item:Q1010734"
From MaRDI portal
The following pages link to Graph-based upper bounds for the probability of the union of events (Q1010734):
Displaying 11 items.
- On bounding the union probability using partial weighted information (Q297136) (← links)
- Lower bounds for the probability of a union via chordal graphs (Q743043) (← links)
- Union-free hypergraphs and probability theory (Q798335) (← links)
- Upper bounds of degree 3 for the probability of the union of events via linear programming (Q1028488) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- Computing bounds for the probability of the union of events by different methods (Q1945070) (← links)
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints (Q2341243) (← links)
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions (Q2357784) (← links)
- New upper bounds on the probability of events based on graph structures (Q3422483) (← links)
- New Bounds of the Probability of a Union (Q4428260) (← links)
- Tight Probability Bounds with Pairwise Independence (Q6158360) (← links)
