Methods for Proving Bonferroni Type Inequalities

DOI10.1112/JLMS/S2-9.4.561MaRDI QIDQ4403054zbMATH OpenOpenAlexFDO

Authors Janos Galambos

Publication date 1975

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-9.4.561

Mathematics Subject Classification ID

Axioms; other general questions in probability (60A05) Combinatorial probability (60C05) Probability distributions: general theory (60E05)

Cited in

(12)

• On the probability of a Boolean polynomial of events
• Hypertrees and Bonferroni inequalities
• Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on \([0, n]\)
• Two rings connected with the inclusion-exclusion principle
• Provably good pattern generators for a random pattern test
• Computing bounds for the probability of the union of events by different methods
• Improved Bonferroni Inequalities and Binomially Bounded Functions
• Optimizing Linear Functions of Random Variables having a Joint Multinomial or Multivariate Normal Distribution
• A new method for generating Bonferroni-type inequalities by iteration
• Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities
• Tight Probability Bounds with Pairwise Independence
• Exact expressions for the maximal probability that all k-wise independent bits are 1

This page was built for publication: Methods for Proving Bonferroni Type Inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4403054)