Here are some notes on bounding joint probability distributions. Enjoy! This was converted from with pandoc, so typos, missing figures, etc., to be expected.
Consider the binary random variables following the distribution . For some collection of values, say, , we are interested in computing .
There is rich literature on bounding joint probabilities, say, , if one has of knowledge of the marginals, , , , or of the moments of the marginal distributions. Some examples of such inequalities follow below.
When the bounds only use , we will say that they utilize first-order information. Similarly, if are used in the bounds, they are of second-order, then third-order, etc.
We start with a classical result, inspired from the inclusion-enclusion formula, known as the Bonferroni inequalities [@galambos1977bonferroni]. The notation corresponds to the negation of the variable, i.e., if , for . First, we define:
Then, for every odd in :
We can also get an upper bound for every even :
By the inclusion-exclusion formula, the inequalities become equalities when . Thus, the inequalities can be made sharper by including more marginals. However, the upper (and lower) bounds don’t necessarily become sharper monotonically as increases; see work by [@schwager1984bonferroni]. Also, although the inequalities are valid for all , they can be uninformative, that is, smaller than zero or greater than one.
An alternative upper bound for the joint is the Frechet-type bound:
This can be simply derived by observing that, for any ,
and then picking the tightest bound. We can also include terms like to the upper bound, if known, to get an even tighter bound. As an upper bound, this may be more suitable than the Bonferroni bound; it is always a valid probability and can be tight when dealing with rare events. Like the Bonferroni bound, this is distribution-independent.
Now, if all we know about the are the , then the tightest bounds[^1] we can get are:
The lower bound comes from the first Bonferroni lower bound. However, it can be further sharpened by adding second-order information, that is, some of the , as discussed by [@hochbergsome]. One example of such a sharpening is known as the Kounias inequality:
This can be further sharpened by replacing the max term in by
where $T$ is the maximal spanning tree, i.e., the tree that maximizes the sum of the probabilities[^2]. The new bound then is:
This bound was first derived in work by [@hunter1976upper] and has been subsequently generalized to work with more events via the construction of multi-trees; see work by [@bukszar2001upper].
In some cases, multiplicative bounds, that is,
may also be applicable when the random variables show positive association; see work by [@esary1967association] for details on that. Those bounds are easier to apply and often tighter but may not always be correct as they are distribution dependent. Especially for Bernoulli variables, Theorem 4. in [@esary1967association] shows that association of the implies only that