Premium
DEGREE, ITERATION AND PERMUTATION IN IMPROVING BONFERRONI‐TYPE BOUNDS
Author(s) -
Seneta E.
Publication year - 1988
Publication title -
australian journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.434
H-Index - 41
eISSN - 1467-842X
pISSN - 0004-9581
DOI - 10.1111/j.1467-842x.1988.tb00462.x
Subject(s) - upper and lower bounds , degree (music) , permutation (music) , mathematics , combinatorics , bonferroni correction , sequence (biology) , type (biology) , alternation (linguistics) , point (geometry) , discrete mathematics , statistics , mathematical analysis , ecology , physics , geometry , biology , acoustics , genetics , linguistics , philosophy
summary This note has as its starting points: 1) the upper bound of Worsley (1982) for the probability of union of n events: 2) the iterative procedure of Hoppe (1985) for deriving successive upper and lower Bonferroni‐type bounds, in alternation, for the probability of such a union. We first show that Worsley's bound (and hence successive bounds based on it) can be sharpened by an initial application of 2) to an appropriate lower bound due to Boole (1854). Subsequently, we show that if the n events are exchangeable, the sequence of bounds obtained from this starting point is that due to Sobel and Uppuluri (1972). The role of degree of a bound is explored, as well as sharpening of bounds by permutation when events are not necessarily exchangeable.