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.
Similar content being viewed by others
References
Bonferroni, C. E. (1937). Teoria statistica delle classi e calcolo delle probabilitá. In Volume in onore di Riccardo Dalla Volta, Universitá di Firenze, Florence, Italy (pp. 1–62).
Boole, G. (1854). Laws of thought (American reprint of 1854 edition). New York: Dover.
Boros, E., & Prékopa, A. (1989). Closed form two-sided bounds for probabilities that exactly r and at least r out of n events occur. Mathematics of Operations Research, 14, 317–342.
Bukszár, J. (2001). Upper bounds for the probability of a union by multitrees. Advances in Applied Probability, 33(2), 437–452.
Bukszár, J., & Prékopa, A. (2001). Probability bounds with cherry trees. Mathematics of Operations Research, 26(1), 174–192.
Bukszár, J., & Szántai, T. (2002). Probability bounds given by hypercherry trees. Optimization Methods & Software, 17, 409–422.
Bukszár, J. (2003). Hypermultitrees and sharp Bonferroni inequalities. Mathematical Inequalities & Applicationso, 6(4), 727–743.
Chung, K. L., & Erdős, P. (1952). On the application of the Borel-Cantelli lemma. Transactions of the American Mathematical Society, 72, 179–186.
Costigan, T. M. (1996). Combination setwise-Bonferroni-type bounds. Naval Research Logistics, 43, 59–77.
Dawson, D. A., & Sankoff, D. (1967). An inequality for probabilities. Proceedings of the American Mathematical Society, 18, 504–507.
De Caen, D. (1997). A lower bound on the probability of a union. Discrete Mathematics, 169, 217–220.
Dohmen, K. (2003). Improved Bonferroni inequalities via abstract tubes. In Lecture notes in mathematics: Vol. 1826. Inequalities and identities of inclusion-exclusion type. Berlin: Springer.
Galambos, J. (1974). Methods for proving Bonferroni type inequalities. Journal of the London Mathematical Society, 9, 561–564.
Galambos, J. (1977). Bonferroni inequalities. Annals of Probability, 5, 577–581.
Galambos, J. (1994). Bonferroni-type inequalities in statistics: a survey. Journal of Applied Statistical Science, 1, 195–209.
Galambos, J., & Simonelli, I. (1996). Bonferroni-type inequalities with applications. Berlin: Springer.
Genz, A. (1992). Numerical computation of the multivariate normal probabilities. Journal of Computational and Graphical Statistics, 1, 141–150.
Gouda, A. A., & Szántai, T. (2010). On numerical calculation of probabilities according to Dirichlet distribution. Annals of Operations Research, 177(1), 185–200.
Hailperin, T. (1965). Best possible inequalities for the probability of a logical function of events. The American Mathematical Monthly, 72, 343–359.
Hoppe, F. M., & Seneta, E. (1990). Bonferroni-type inequalities and the methods of indicators and polynomials. Advances in Applied Probability, 22(1), 241–246.
Hunter, D. (1976). An upper bound for the probability of a union. Journal of Applied Probability, 13, 597–603.
Kounias, S. (1968). Bounds for the probability of a union, with applications. Annals of Mathematical Statistics, 39, 2154–2158.
Kuai, H., Alajaji, F., & Takahara, G. (2000). A lower bound on the probability of a finite union of events. Discrete Mathematics, 215(2), 147–158.
Kwerel, S. M. (1975a). Bounds on probability of a union and intersection of m events. Advances in Applied Probability, 7, 431–448.
Kwerel, S. M. (1975b). Most stringent bounds on aggregated probabilities of partially specified dependent probability systems. Journal of the American Statistical Association, 70, 472–479.
Mádi-Nagy, G. (2005). A method to find the best bounds in a multivariate discrete moment problem if the basis structure is given. Studia Scientiarum Mathematicarum Hungarica, 42(2), 207–226.
Mádi-Nagy, G. (2009a). On multivariate discrete moment problems: generalization of the bivariate min algorithm for higher dimensions. SIAM Journal on Optimization, 19(4), 1781–1806.
Mádi-Nagy, G. (2009b). Numerical applications. http://www.math.bme.hu/~gnagy/appl/applications.htm.
Mádi-Nagy, G., & Prékopa, A. (2004). On multivariate discrete moment problems and their applications to bounding expectations and probabilities. Mathematics of Operations Research, 29(2), 229–258.
Móri, T. F., & Székely, G. J. (1985). A note on the background of several Bonferroni-Galambos-type inequalities. Journal of Applied Probability, 22(4), 836–843.
Prékopa, A. (1988). Boole-Bonferroni inequalities and linear programming. Operations Research, 36, 145–162.
Prékopa, A. (1990a). Sharp bounds on probabilities using linear programming. Operations Research, 38, 227–239.
Prékopa, A. (1990b). The discrete moment problem and linear programming. Discrete Applied Mathematics, 27, 235–254.
Prékopa, A. (1992). Inequalities on expectations based on the knowledge of multivariate moments. In M. Shaked & Y. L. Tong (Eds.), Lecture notes—monograph series: Vol. 22. Stochastic inequalities (pp. 309–331). Hayward: Institute of Mathematical Statistics.
Prékopa, A. (1995). Stochastic programming. Dordrecht: Kluwer Academic.
Prékopa, A. (1998). Bounds on probabilities and expectations using multivariate moments of discrete distributions. Studia Scientiarum Mathematicarum Hungarica, 34(1–3), 349–378.
Prékopa, A., & Gao, L. (2005). Bounding the probability of the union of events by the use of aggregation and disaggregation in linear programs. Discrete Applied Mathematics, 145, 444–454.
Recsei, E., & Seneta, E. (1987). Bonferroni-type inequalities. Advances in Applied Probability, 19(2), 508–511.
Szántai, T. (2000). Improved bounds and simulation procedures on the value of the multivariate normal probability distribution function. Annals of Operations Research, 100, 85–101.
Tomescu, I. (1986). Hypertrees and Bonferroni inequalities. Journal of Combinatorial Theory. Series B, 41(2), 209–217.
Veneziani, P. (2002). Combinatorics of Boole’s problem. Ph.D. Thesis, RUTCOR, Rutgers University.
Veneziani, P. (2009). Upper bounds of degree 3 for the probability of the union of events via linear programming. Discrete Applied Mathematics, 157, 858–863.
Worsley, K. J. (1982). An improved Bonferroni inequality and applications. Biometrika, 69, 197–302.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bukszár, J., Mádi-Nagy, G. & Szántai, T. Computing bounds for the probability of the union of events by different methods. Ann Oper Res 201, 63–81 (2012). https://doi.org/10.1007/s10479-012-1231-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-012-1231-1