Graph-based upper bounds for the probability of the union of events
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/752
Classification : 60C05, 60E15, 90C05
@article{10_37236_752,
     author = {Pierangela Veneziani},
     title = {Graph-based upper bounds for the probability of the union of events},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/752},
     zbl = {1159.60010},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/752/}
}
TY  - JOUR
AU  - Pierangela Veneziani
TI  - Graph-based upper bounds for the probability of the union of events
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/752/
DO  - 10.37236/752
ID  - 10_37236_752
ER  - 
%0 Journal Article
%A Pierangela Veneziani
%T Graph-based upper bounds for the probability of the union of events
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/752/
%R 10.37236/752
%F 10_37236_752
Pierangela Veneziani. Graph-based upper bounds for the probability of the union of events. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/752

Cité par Sources :