Bonferroni-Type Inequalities via Chordal Graphs Journalartikel uri icon

 

Abstract

  • Let {Av}v∈V be a finite collection of events and G = (V, E) be a chordal graph. Our main result – the chordal graph sieve – is a Bonferroni-type inequality where the selection of intersections in the estimates is determined by a chordal graph G. It interpolates between Boole's inequality (G empty) and the sieve formula (G complete). By varying G, several inequalities both well-known and new are obtained in a concise and unified way.

Veröffentlichungszeitpunkt

  • 2002

Heftnummer

  • 4

Band

  • 11

Startseite

  • 349

letzte Seite

  • 351

Seitenzahl

  • 2