A complete proof of universal inequalities for the distribution function of the binomial law
From MaRDI portal
Publication:2863595
DOI10.1137/S0040585X97986138zbMATH Open1280.60016OpenAlexW2074125290MaRDI QIDQ2863595FDOQ2863595
Abstract: We present a new form and a short full proof of explicit two-sided estimates for the distribution function F_{n,p}(x) of the binomial law from the paper published by D.Alfers and H.Dinges in 1984. These inequalities are universal (valid for all binomial distribution and all values of argument) and exact (namely, the upper bound for F_{n,p}(k) is the lower bound for F_{n,p}(k+1)). By means of such estimates it is possible to bound any quantile of the binomial law by 2 subsequent integers.
Recommendations
- Distribution inequalities for the binomial law
- Improved inequalities for the Poisson and binomial distribution and upper tail quantile functions
- Best upper and lower bounds of the generalized binomial distribution
- Bounds for median and 50 percentage points of binomial and negative binomial distribution
- Refined Kolmogorov inequalities for the binomial distribution
Cited in
(21)- Poisson approximation
- Bernstein's inequalities and their extensions for getting the Black-Scholes option pricing formula
- Statistical estimation of conditional Shannon entropy
- Friendly bisections of random graphs
- Nearly optimal Bayesian shrinkage for high-dimensional regression
- Euler summability method of sequences of fuzzy numbers and a Tauberian theorem
- Improved inequalities for the Poisson and binomial distribution and upper tail quantile functions
- On a functional of the number of nonoverlapping chains appearing in the polynomial scheme and its connection with entropy
- Bayesian fusion estimation via \(t\) shrinkage
- Distribution inequalities for the binomial law
- Efficient random graph matching via degree profiles
- On the lifetime of a size-dependent branching process
- On binomial quantile and proportion bounds: With applications in engineering and informatics
- Mean and variance of the number of subfunctions of random Boolean function which are close to the affine functions set
- Polynomial approximation on disjoint segments and amplification of approximation
- Best upper and lower bounds of the generalized binomial distribution
- Bayesian shrinkage towards sharp minimaxity
- A non-uniform bound of the remainder term in the central limit theorem for Bernoulli random variables
- Convergence of optimal expected utility for a sequence of binomial models
- Criticality of regular formulas
- On quantiles of minimal codeword weights of random linear codes over \(\mathbf{F}_p\)
This page was built for publication: A complete proof of universal inequalities for the distribution function of the binomial law
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863595)
