Graph-based upper bounds for the probability of the union of events

MaRDI QIDQ1010734zbMATH OpenFDO

Authors Pierangela Veneziani

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, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r28.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorial probability (60C05) Inequalities; stochastic orderings (60E15) Linear programming (90C05)

Review text

Summary: We consider the problem of generating upper bounds for the probability of the union of events when the individual probabilities of the events as well as the probabilities of pairs of these events are known. By formulating the problem as a Linear Program, we can obtain bounds as objective function values corresponding to dual basic feasible solutions. The new upper bounds are based on underlying bipartite and threshold type graph structures.

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

(13)

• 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
• Computing bounds for the probability of the union of events by different methods
• Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
• New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
• On bounding the union probability using partial weighted information
• New upper bounds on the probability of events based on graph structures
• New Bounds of the Probability of a Union
• Polynomially computable bounds for the probability of the union of events
• Tight Probability Bounds with Pairwise Independence
• Sharp bounds for the probability that exactly k-out-of-n events occur with unimodal distributions
• Lower bounds for the probability of a union via chordal graphs
• Union-free hypergraphs and probability theory

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)