Lower Bounds on the Probability of a Finite Union of Events

DOI10.1137/15M100866XzbMath1343.60004arXiv1401.5543OpenAlexW2569664619MaRDI QIDQ5741087

Fady Alajaji, Jun Yang, Glen K. Takahara

Publication date: 22 July 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.5543

zbMATH Keywords

linear programminglower and upper boundsoptimal boundsprobability of a finite union of events

Mathematics Subject Classification ID

Related Items (3)

Linear programming bounds on the union probability ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Approximating two-stage chance-constrained programs with classical probability bounds

Cites Work

• Unnamed Item
• Some inequalities in functional analysis, combinatorics, and probability theory
• The effect of redundancy on probability bounds
• 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
• Improving probability bounds by optimization over subsets
• A Fréchet-optimal strengthening of the Dawson-Sankoff lower bound
• Tight error bounds for nonuniform signaling over AWGN channels
• New upper bounds on the probability of events based on graph structures
• On the Móri-Székely conjectures for the Borel-Cantelli lemma
• Polynomially Computable Bounds for the Probability of the Union of Events
• A bound for the maximum of a number of random variables
• An Inequality for Probabilities
• Bounds for the Probability of a Union, with Applications

This page was built for publication: Lower Bounds on the Probability of a Finite Union of Events