Key points are not available for this paper at this time.
We present an improved Bonferroni inequality which gives an upper bound for the probability of the union of an arbitrary sequence of events. The bound is constructed in terms of the joint probability of pairs of events, which are represented by edges on a graph. Examples of applications to periodicity, location shift detection, Kolmogorov-Smirnov tests and outlier detection are given.
Keith J. Worsley (Fri,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: