Lower bounds for the probability of a union via chordal graphs
From MaRDI portal
Publication:743043
DOI10.1214/ECP.v18-2357zbMath1349.60007arXiv1004.3416MaRDI QIDQ743043
Publication date: 22 September 2014
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.3416
Combinatorial probability (60C05) Combinatorial inequalities (05A20) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Estimating the number of connected components in a graph via subgraph sampling ⋮ Complexity of some graph-based bounds on the probability of a union of events ⋮ Polynomially Computable Bounds for the Probability of the Union of Events