pith. sign in

arxiv: 1004.1862 · v1 · submitted 2010-04-12 · 🧮 math.PR

On the Exponential Probability Bounds for the Bernoulli Random Variables

classification 🧮 math.PR
keywords exponentialalphaboundscasecoefficientepsilonbernoullibeta
0
0 comments X
read the original abstract

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha, beta}. In order to optimize the bound we are interested to minimize linear coefficient alpha and to maximize exponential coefficient beta. Generally, the value of linear coefficient alpha may not be smaller than one. The following 2 settings were proved: 1) {1, 2} in the case of classical discreet problem as it was formulated by Bernoulli in the 17th century, and 2) {1, 2/(1+epsilon^2)} in the general discreet case with arbitrary rational p and epsilon. The second setting represents a new structure of the exponential bound which may be extended to continuous case.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.