An Inequality for Probabilities
From MaRDI portal
Publication:5534673
DOI10.2307/2035487zbMath0154.19401OpenAlexW4244961743MaRDI QIDQ5534673
David Sankoff, Donald A. Dawson
Publication date: 1967
Full work available at URL: https://doi.org/10.2307/2035487
Related Items (48)
New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions ⋮ 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 ⋮ Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs ⋮ Persistent convergence on randomly deleted sets ⋮ Improving probability bounds by optimization over subsets ⋮ On bounding the union probability using partial weighted information ⋮ Bounds on skyline probability for databases with uncertain preferences ⋮ Applications of cut polyhedra. II ⋮ A note on bivariate Dawson-Sankoff-type bounds ⋮ A lower bound on the probability of a union ⋮ Improved bivariate Bonferroni-type inequalities ⋮ A lower bound using Hamilton-type circuits and its applications ⋮ Optimizing Linear Functions of Random Variables having a Joint Multinomial or Multivariate Normal Distribution ⋮ On estimation of probabilities of unions of events with applications to the Borel-Cantelli lemma ⋮ On inequalities for values of first jumps of distribution functions and Hölder's inequality ⋮ Linear programming bounds on the union probability ⋮ Sharp probability bounds for the binomial moment problem with symmetry ⋮ Strengthened bounds for the probability of \(k\)-out-of-\(n\) events ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Computing bounds for the probability of the union of events by different methods ⋮ Monge properties, discrete convexity and applications ⋮ A Fréchet-optimal strengthening of the Dawson-Sankoff lower bound ⋮ On the probability of union in the $n$-space ⋮ Bounds for probabilities of unions of events and the Borel-Cantelli lemma ⋮ On upper and lower bounds for probabilities of combinations of events ⋮ A new method for generating Bonferroni-type inequalities by iteration ⋮ Deterministic approximations of probability inequalities ⋮ Fréchet optimal bounds on the probability of a union with supplementary information ⋮ Lower Bounds on the Probability of a Finite Union of Events ⋮ Bounding the probability of the union of events by aggregation and disaggregation in linear programs ⋮ A generator for explicit univariate lower bounds ⋮ Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities ⋮ Improved bounds on the probability of the union of events some of whose intersections are empty ⋮ Bounds for the probability of union of events following monotonic distribution ⋮ The maximal probability that k‐wise independent bits are all 1 ⋮ The effect of redundancy on probability bounds ⋮ On inequalities for probabilities wherein at least \(r\) from \(n\) events occur ⋮ On inequalities for probabilities of joint occurrence of several events ⋮ On bounds for probabilities of combinations of events, the Jordan formula, and the Bonferroni inequalities ⋮ Some Optimal Bivariate Bonferroni-Type Bounds ⋮ Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known ⋮ On the Borel-Cantelli lemma and its generalization ⋮ Moment estimates in the first Borel-Cantelli lemma with applications to mean deviation frequencies ⋮ Approximating two-stage chance-constrained programs with classical probability bounds ⋮ Polynomially Computable Bounds for the Probability of the Union of Events ⋮ The value of shape constraints in discrete moment problems: a review and extension ⋮ Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
Uses Software
Cites Work
This page was built for publication: An Inequality for Probabilities
