Probability bounds given by hypercherry trees

Abstract

In this article new lower and upper bounds are given for the probability of the union of events. For this purpose the new concept of hypercherry trees has been introduced. Earlier the concept of cherry tree and its application for bounding the probability of union of events was introduced by Bukszár and Prékopa. This, based on the cherry tree bound, is always an upper bound, and it can be regarded as a generalisation of the upper bound introduced by Hunter by means of maximum weight spanning trees. Later the Hunter bound was generalised by Tomescu. He used the concept of hypertrees in the framework of uniform hypergraphs and on the basis of these new hypergraph structures it became possible to define not only upper but also lower bounds on the probability of union of events. The new bounds of the paper are generalisations of Tomescu's bounds in the same sense as the upper bound by Bukszár and Prékopa was a generalisation of the Hunter bound. The efficiency of the new bounds is illustrated on some test problems according to multivariate normal probability distribution function calculations.