Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-14T03:29:43.156Z Has data issue: false hasContentIssue false
  • English
  • Français

Bonferroni inequalities and deviations of discrete distributions

Part of: Distribution theory - Probability

Published online by Cambridge University Press:  14 July 2016

Tamás F. Móri
Tamás F. Móri*
Affiliation:
Eötvös Loránd University
*
∗Postal address: Department of Probability Theory and Statistics, Eötvös Loránd University, Budapest, Múzeum krt.6–8, H-1088 Hungary. E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In the paper we first show how to convert a generalized Bonferroni-type inequality into an estimation for the generating function of the number of occurring events, then we give estimates for the deviation of two discrete probability distributions in terms of the maximum distance between their generating functions over the interval [0, 1].

Keywords

BONFERRONI INEQUALITIESPROBABILITY GENERATING FUNCTIONS

MSC classification

Primary: 60E15: Inequalities; stochastic orderings
Secondary: 60E10: Characteristic functions; other transforms
Type
Research Papers
Information
Journal of Applied Probability , Volume 33 , Issue 1 , March 1996 , pp. 115 - 121
Copyright
Copyright © Applied Probability Trust 1996 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Research supported by the Hungarian National Foundation for Scientific Research, Grant N° 1405.

References

[1] Galambos, J. (1966) On the sieve methods in probability theory I. Studia Sci. Mat. Hungar. 1, 39–50.Google Scholar
[2] Galambos, J. and Kátai, I., (eds) (1992) Probability Theory and Applications — Essays to the Memory of József Mogyoródi. Kluwer, Dordrecht.CrossRefGoogle Scholar
[3] Móri, T. F. (1990) More on the waiting time till each of some given patterns occurs as a run. Can. J. Math. 42, 915–932.CrossRefGoogle Scholar
[4] Rényi, A. (1976) A general method for proving theorems in probability theory and some of its applications. In Selected Papers of A. Rényi, Vol. 2. pp. 581–602. Akadémiai Kiadó, Budapest.Google Scholar