Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
From MaRDI portal
Publication:4127811
DOI10.2307/2285843zbMATH Open0356.62054OpenAlexW4248821906MaRDI QIDQ4127811FDOQ4127811
Authors: Seymour M. Kwerel
Publication date: 1975
Full work available at URL: https://doi.org/10.2307/2285843
Multivariate analysis (62H99) Inference from stochastic processes (62M99) Applications of statistics in engineering and industry; control charts (62P30) Linear programming (90C05) Applications of renewal theory (reliability, demand theory, etc.) (60K10)
Cited In (41)
- On the probability of union in the $n$-space
- Monge properties, discrete convexity and applications
- Deterministic approximations of probability inequalities
- Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs
- On estimation of probabilities of unions of events with applications to the Borel-Cantelli lemma
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- On inequalities for probabilities of unions of events and the Borel-Cantelli lemma
- On inequalities for values of first jumps of distribution functions and Hölder's inequality
- Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities
- Bounds on generalized family-wise error rates for normal distributions
- Mean time to failure of systems with dependent components
- Computing bounds for the probability of the union of events by different methods
- On upper and lower bounds for probabilities of combinations of events
- On inequalities for probabilities wherein at least \(r\) from \(n\) events occur
- Bounds for the probability of union of events following monotonic distribution
- Approximating two-stage chance-constrained programs with classical probability bounds
- A new method for generating Bonferroni-type inequalities by iteration
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Tight Probability Bounds with Pairwise Independence
- The maximal probability that \(k\)-wise independent bits are all 1
- Polynomially computable bounds for the probability of the union of events
- Bonferroni-type inequalities for conditional scan statistics
- The truncated moment problem on \(\mathbb{N}_0\)
- Improved bounds on the probability of the union of events some of whose intersections are empty
- On inequalities for probabilities of joint occurrence of several events
- A modified Benjamini-Hochberg multiple comparisons procedure for controlling the false discovery rate
- Scharfe untere und obere Schranken für die Wahrscheinlichkeit der Realisation von k unter n Ereignissen
- Upper and lower bounds for the probability that r events occur
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
- Bounds and approximations for pairwise comparisons of independent multinormal means
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
- Iterating Bonferroni bounds
- Numerical evaluation of singular multivariate normal distributions
- Fréchet optimal bounds on the probability of a union with supplementary information
- Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known
- Bivariate Bonferroni inequalities
- Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on \([0, n]\)
- Sharp probability bounds for the binomial moment problem with symmetry
- Approximate inclusion-exclusion
- Behavior of FWER in Normal Distributions
- The value of shape constraints in discrete moment problems: a review and extension
This page was built for publication: Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127811)