Linear programming bounds on the union probability
From MaRDI portal
Publication:5087556
DOI10.1080/03610918.2018.1468459OpenAlexW2898517553WikidataQ129011741 ScholiaQ129011741MaRDI QIDQ5087556
Fady Alajaji, Jun Yang, Glen K. Takahara
Publication date: 1 July 2022
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2018.1468459
Cites Work
- Unnamed Item
- Unnamed Item
- On bounding the union probability using partial weighted information
- Some inequalities in functional analysis, combinatorics, and probability theory
- On the Borel-Cantelli lemma and its generalization
- A lower bound on the probability of a union
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- A lower bound on the probability of a finite union of events
- Bounds 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
- Tight error bounds for nonuniform signaling over AWGN channels
- New upper bounds on the probability of events based on graph structures
- A lower bound on the error probability for signals in white Gaussian noise
- 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
- A bound for the maximum of a number of random variables
- An Inequality for Probabilities
- Bounds for the Probability of a Union, with Applications
- Lower Bounds on the Probability of a Finite Union of Events
- On the Application of the Borel-Cantelli Lemma
This page was built for publication: Linear programming bounds on the union probability
