Probability bounds given by hypercherry trees
From MaRDI portal
Recommendations
- Publication:4953900
- Probability bounds given by multitrees
- scientific article; zbMATH DE number 3922702
- Hypertrees and Bonferroni inequalities
- Hypermultitrees and sharp Bonferroni inequalities
- scientific article; zbMATH DE number 953132
- On a tail bound for analyzing random trees
- On tail bounds for random recursive trees
- Limits of random trees
- Upper bounds for the probability of a union by multitrees
Cites work
- An upper bound for the probability of a union
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Generating Correlation Matrices
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- Hypertrees and Bonferroni inequalities
- Probability bounds with cherry trees.
Cited in
(12)- Complexity of some graph-based bounds on the probability of a union of events
- Hypergraphs as a mean of discovering the dependence structure of a discrete multivariate probability distribution
- Computing bounds for the probability of the union of events by different methods
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints
- Probability bounds given by multitrees
- Upper bounds for the probability of a union by multitrees
- Probability bounds with cherry trees.
- Discovering a junction tree behind a Markov network by a greedy algorithm
- scientific article; zbMATH DE number 1748521 (Why is no real title available?)
- scientific article; zbMATH DE number 1446741 (Why is no real title available?)
- On the analytical-numerical valuation of the Bermudan and American options
- Optimality conditions for Hunter's bound
This page was built for publication: Probability bounds given by hypercherry trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709731)
