Computing bounds for the probability of the union of events by different methods

József Bukszár (), Gergely Mádi-Nagy () and Tamás Szántai ()

Annals of Operations Research, 2012, vol. 201, issue 1, 63-81

Abstract: Let A 1 ,…,A n be arbitrary events. The underlying problem is to give lower and upper bounds on the probability P(A 1 ∪⋯∪A n ) based on $P(A_{i_{1}}\cap\cdots\cap A_{i_{k}})$ , 1≤i 1 >⋯>i k ≤n, where k=1,…,d, and d≤n (usually d≪n) is a certain integer, called the order of the problem or the bound. Most bounding techniques fall in one of the following two main categories: those that use (hyper)graph structures and the ones based on binomial moment problems. In this paper we compare bounds from the two categories with each other, in particular the bounds yielded by univariate and multivariate moment problems are compared with Bukszár’s hypermultitree bounds. In the comparison we considered several numerical examples, most of which have important practical applications, e.g., the approximation of the values of multivariate cumulative distribution functions or the calculation of network reliability. We compare the bounds based on how close they are to the real value and the time required to compute them, however, the problems arising in the implementations of the methods as well as the limitations of the usability of the bounds are also illustrated. Copyright Springer Science+Business Media New York 2012

Keywords: Discrete moment problem; Linear programming; Hypergraphs; Expectation bounds; Probability bounds; Multivariate distribution function; Network reliability (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-012-1231-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:201:y:2012:i:1:p:63-81:10.1007/s10479-012-1231-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-012-1231-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().