ISSN:
1439-6912
Keywords:
05 A 15
;
05 A 16
;
05 A 20
;
60 C 05
;
41 A 10
;
68 R
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract It is often required to find the probability of the union of givenn eventsA 1 ,...,A n . The answer is provided, of course, by the inclusion-exclusion formula: Pr(∪A i )=∑ i −∑ i〈j Pr(A i ∩A j )±.... Unfortunately, this formula has exponentially many terms, and only rarely does one manage to carry out the exact calculation. From a computational point of view, finding the probability of the union is an intractable, #P-hard problem, even in very restricted cases. This state of affairs makes it reasonable to seek approximate solutions that are computationally feasible. Attempts to find such approximate solutions have a long history starting already with Boole [1]. A recent step in this direction was taken by Linial and Nisan [4] who sought approximations to the probability of the union, given the probabilities of allj-wise intersections of the events forj=1,...k. The developed a method to approximate Pr(∪A i ), from the above data with an additive error of exp $$( - O(k/\sqrt n ))$$ . In the present article we develop an expression that can be computed in polynomial time, that, given the sums ∑|S|=j Pr(∩ i∈S A i ) forj=1,...k, approximates Pr(∪A i ) with an additive error of exp $$( - \bar \Omega (k^2 /n))$$ . This error is optimal, up to the logarithmic factor implicit in the $$\bar \Omega$$ notation. The problem of enumerating satisfying assignments of a boolean formula in DNF formF=v l m C i is an instance of the general problem that had been extensively studied [7]. HereA i is the set of assignments that satisfyC i , and Pr(∩ i∈S A i )=a S /2n where ∧ i∈S C i is satisfied bya S assignments. Judging from the general results, it is hard to expect a decent approximation ofF's number of satisfying assignments, without knowledge of the numbersa S for, say, all cardinalities $$1 \leqslant |S| \leqslant \sqrt m$$ . Quite surprisingly, already the numbersa S over |S|≤log(n+1)uniquely determine the number of satisfying assignments for F. We point out a connection between our work and the edge-reconstruction conjecture. Finally we discuss other special instances of the problem, e.g., computing permanents of 0,1 matrices, evaluating chromatic polynomials of graphs and for families of events whose VC dimension is bounded.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01271266
Permalink
