Graph-based upper bounds for the probability of the union of events
From MaRDI portal
Publication:1010734
zbMath1159.60010MaRDI QIDQ1010734
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129795
Inequalities; stochastic orderings (60E15) Linear programming (90C05) Combinatorial probability (60C05)
Related Items (3)
New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
This page was built for publication: Graph-based upper bounds for the probability of the union of events