Open Access
2002 Inclusion-Exclusion Redux
David Kessler, Jeremy Schiff
Author Affiliations +
Electron. Commun. Probab. 7: 85-96 (2002). DOI: 10.1214/ECP.v7-1050

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.

Citation

Download Citation

David Kessler. Jeremy Schiff. "Inclusion-Exclusion Redux." Electron. Commun. Probab. 7 85 - 96, 2002. https://doi.org/10.1214/ECP.v7-1050

Information

Accepted: 11 March 2002; Published: 2002
First available in Project Euclid: 16 May 2016

zbMATH: 1008.60016
MathSciNet: MR1902596
Digital Object Identifier: 10.1214/ECP.v7-1050

Subjects:
Primary: 60C05

Keywords: close-to-independent events , Inclusion-exclusion principle

Back to Top