DOI QR코드

DOI QR Code

IMPROVED UPPER BOUNDS OF PROBABILITY

  • Published : 2003.10.01

Abstract

Let $A_1,{\;}A_2,...,A_n$ be a sequence of events on a given probability space. Let $m_n$ be the number of those $A'_{j}s$ which occur. Upper bounds of P($m_n{\;}\geq{\;}1) are obtained by means of probability of consecutive terms which reduce the number of terms in binomial moments $S_2,n,S_3,n$ and $S_4,n$.

Keywords

References

  1. Probability Bounds with cherry trees J.Bukszar;A.Prekopa
  2. Studia Sci. Math., Hungar. v.1 On the sieve methods in probability theoryⅠ J.Galambos
  3. J. Appl. Prob. v.13 An upper bound for the probability of a union D.Hunter https://doi.org/10.2307/3212481
  4. Ann. Math. Stat. v.39 Bounds for the probability of a union, with applications E.G.Kounias https://doi.org/10.1214/aoms/1177698049
  5. Adv. Appl. Prob. v.7 Bound on the probability of the union and intersection of m events S.M.Kwerel https://doi.org/10.2307/1426084
  6. Aequationes Mathematicae v.44 Bonferroni-type inequalities M.Y.Lee https://doi.org/10.1007/BF01830980
  7. Biometrika v.63 Tests of the Kolmogorov-Smirnov type for exponential date with unknown scale and related problems B.J.Margolin;W.Maurer https://doi.org/10.1093/biomet/63.1.149
  8. Original in Hungarian. Translated into English in : Selected Papers of A. Renyi v.2 A general method for proving theorems in probability theory and some of its applications A.Renyi
  9. Biometrika v.69 An improved Bonferroni inequality and applications K.J.Worsley https://doi.org/10.1093/biomet/69.2.297