Probability bounds given by hypercherry trees

DOI10.1080/1055678021000033955zbMath1064.60015OpenAlexW2000556245MaRDI QIDQ4709731

Tamás Szántai, József Bukszár

Publication date: 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/1055678021000033955

zbMATH Keywords

Probability Bounds, Multivariate Normal Probability Distribution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Inequalities; stochastic orderings (60E15) Trees (05C05) Hypergraphs (05C65) Combinatorial probability (60C05)

Related Items (6)

Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution ⋮ Discovering a junction tree behind a Markov network by a greedy algorithm ⋮ Computing bounds for the probability of the union of events by different methods ⋮ Complexity of some graph-based bounds on the probability of a union of events ⋮ On the analytical–numerical valuation of the Bermudan and American options ⋮ Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints

Cites Work

• Unnamed Item
• Hypertrees and Bonferroni inequalities
• Probability Bounds with Cherry Trees
• Generating Correlation Matrices
• An upper bound for the probability of a union
• Best Possible Inequalities for the Probability of a Logical Function of Events

This page was built for publication: Probability bounds given by hypercherry trees