An Inequality for Probabilities
From MaRDI portal
Publication:5534673
Cites work
Cited in
(48)- On the probability of union in the $n$-space
- Monge properties, discrete convexity and applications
- Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs
- Deterministic approximations of probability inequalities
- A lower bound using Hamilton-type circuits and its applications
- 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
- A note on bivariate Dawson-Sankoff-type bounds
- Bounds on skyline probability for databases with uncertain preferences
- Optimizing Linear Functions of Random Variables having a Joint Multinomial or Multivariate Normal Distribution
- On the Borel-Cantelli lemma and its generalization
- On bounding the union probability using partial weighted information
- 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
- On bounds for probabilities of combinations of events, the Jordan formula, and the Bonferroni inequalities
- Linear programming bounds on the union probability
- Bounds for the probability of union of events following monotonic distribution
- Applications of cut polyhedra. II
- 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
- The effect of redundancy on probability bounds
- 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
- A generator for explicit univariate lower bounds
- 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 lower bound on the probability of a union
- Strengthened bounds for the probability of \(k\)-out-of-\(n\) events
- Bounds for probabilities of unions of events and the Borel-Cantelli lemma
- Persistent convergence on randomly deleted sets
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
- Some Optimal Bivariate Bonferroni-Type Bounds
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions
- A Fréchet-optimal strengthening of the Dawson-Sankoff lower bound
- Improving probability bounds by optimization over subsets
- 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
- Moment estimates in the first Borel-Cantelli lemma with applications to mean deviation frequencies
- Improved bivariate Bonferroni-type inequalities
- Sharp probability bounds for the binomial moment problem with symmetry
- Lower bounds on the probability of a finite union of events
- The value of shape constraints in discrete moment problems: a review and extension
This page was built for publication: An Inequality for Probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534673)
