Abstract
We present a reordered version of the inclusion-exclusion principle, which is useful when computing the probability of a union of events which are close to independent. The advantages of this formulation are demonstrated in the context of 3 classic problems in combinatorics.
| Original language | English |
|---|---|
| Pages (from-to) | 85-96 |
| Number of pages | 12 |
| Journal | Electronic Communications in Probability |
| Volume | 7 |
| DOIs | |
| State | Published - 1 Jan 2002 |
Keywords
- Close-to-independent events
- Inclusion-exclusion principle