Inclusion-exclusion redux

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

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 languageEnglish
Pages (from-to)85-96
Number of pages12
JournalElectronic Communications in Probability
Volume7
DOIs
StatePublished - 1 Jan 2002

Keywords

  • Close-to-independent events
  • Inclusion-exclusion principle

Fingerprint

Dive into the research topics of 'Inclusion-exclusion redux'. Together they form a unique fingerprint.

Cite this