Linear programming bounds on the union probability
From MaRDI portal
Cites work
- A bound for the maximum of a number of random variables
- A lower bound on the error probability for signals in white Gaussian noise
- A lower bound on the probability of a finite union of events
- A lower bound on the probability of a union
- An Inequality for Probabilities
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Bounds for probabilities of unions of events and the Borel-Cantelli lemma
- Bounds for the Probability of a Union, with Applications
- scientific article; zbMATH DE number 3155636 (Why is no real title available?)
- scientific article; zbMATH DE number 1222377 (Why is no real title available?)
- Lower bounds on the probability of a finite union of events
- New upper bounds on the probability of events based on graph structures
- On bounding the union probability using partial weighted information
- On inequalities for values of first jumps of distribution functions and Hölder's inequality
- On the Application of the Borel-Cantelli Lemma
- On the Borel-Cantelli lemma and its generalization
- On the Móri-Székely conjectures for the Borel-Cantelli lemma
- Polynomially computable bounds for the probability of the union of events
- Probabilistic set covering with correlations
- Some inequalities in functional analysis, combinatorics, and probability theory
- Tight error bounds for nonuniform signaling over AWGN channels
Cited in
(3)
This page was built for publication: Linear programming bounds on the union probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087556)
