REVIEW 2 cited by
A full proof of universal inequalities for the distribution function of the binomial law
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A full proof of universal inequalities for the distribution function of the binomial law
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Worst-Case Maximal Inequalities for Heavy-tailed Random Vectors
The paper characterizes the worst-case expected top-k norm of sample averages for heavy-tailed vectors up to universal constants under envelope moment conditions.
-
Notes on constants for maxima of Rademacher averages
Proves E[max_j | (1/n) sum_i ε_ij |] ≥ min{255/256, (1/sqrt(2 log 2)) sqrt(log(2p)/n)} with equality for (n,p)=(2,1) and (2,8).
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.