1968
DOI: 10.1214/aoms/1177698049
|View full text |Cite
|
Sign up to set email alerts
|

Bounds for the Probability of a Union, with Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
73
0
1

Year Published

1987
1987
2019
2019

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 214 publications
(75 citation statements)
references
References 4 publications
1
73
0
1
Order By: Relevance
“…Denoting the failure probability of two failure modes failing simultaneously as = , the failure probability of the systems , according to the narrow bound [38,40], is…”
Section: Ditlevsen's Bounds Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Denoting the failure probability of two failure modes failing simultaneously as = , the failure probability of the systems , according to the narrow bound [38,40], is…”
Section: Ditlevsen's Bounds Methodsmentioning
confidence: 99%
“…Since the physical mechanism of the two errors affecting the hydrologic model is unclear, an unknown performance function is first considered. In reliability theory, the wide and narrow bounds methods [38][39][40] were used to calculate reliability indexes of serial and parallel structural systems. Here, the serial or parallel structured error represent the relationship to the reliability of the hydrological model, where the forecasted rainfall and flood are both used to calculate the forecast error.…”
Section: Unknown Performance Functionmentioning
confidence: 99%
“…The bound is a suboptimal instance of the following bound by Kounias [16], which is generally infeasible to determine exactly…”
Section: A Stepwise Algorithm Lower Boundmentioning
confidence: 99%
“…This bound-which is due to Kounias [16]-is expressed in terms of only the individual (P (A i )'s) and pairwise (P (A i \ A j )'s) event probabilities. It is obtained as an optimal bound over a family of bounds which is indexed by the set of all subsets of f1; 2; .…”
Section: Introductionmentioning
confidence: 99%
“…An attractive approach is, therefore, to investigate more sophisticated bounds that yield accurate error estimates. Three such bounds on the probability of a finite union of arbitrary events were recently studied in [8] and [9]: a lower bound (the Kuai-Alajaji-Takahara (KAT) bound) [8], a practical algorithmic stepwise lower bound [9] originating from Kounias [6], and a greedy algorithmic implementation [9] of an upper bound due to Hunter [5]. In this letter, we apply these bounds, which are only expressed in terms of the individual event probabilities and the pairwise event probabilities , to estimate the performance of nonuniform signaling under Gray mapping over memoryless Rayleigh fading channels.…”
mentioning
confidence: 99%