The DOI matches its Crossref record.
On the Distribution of the Number of Successes in Independent Trials
Open accessAbstract
Let $S$ be the number of successes in $n$ independent trials, and let $p_j$ denote the probability of success in the $j$th trial, $j = 1, 2, \cdots, n$ (Poisson trials). We consider the problem of finding the maximum and the minimum of $Eg(S),$ the expected value of a given real-valued function of $S,$ when $ES = np$ is fixed. It is well known that the maximum of the variance of $S$ is attained when $p_1 = p_2 = \cdots = p_n = p.$ This can be interpreted as showing that the variability in the number of successes is highest when the successes are equally probable (Bernoulli trials). This interpretation is further supported by the following two theorems, proved in this paper. If $b$ and $c$ are two integers, $0 \leqq b \leqq np \leqq c \leqq n,$ the probability $P(b \leqq S \leqq c)$ attains its minimum if and only if $p_1 = p_2 = \cdots = p_n = p,$ unless $b = 0$ and $c = n$ (Theorem 5, a corollary of Theorem 4, which gives the maximum and the minimum of $P(S \leqq c)$). If $g$ is a strictly convex function, $Eg(S)$ attains its maximum if and only if $p_1 = p_2 = \cdots = p_n = p$ (Theorem 3). These results are obtained with the help of two theorems concerning the extrema of the expected value of an arbitrary function $g(S)$ under the condition $ES = np.$ Theorem 1 gives necessary conditions for the maximum and the minimum of $Eg(S).$ Theorem 2 gives a partial characterization of the set of points at which an extremum is attained. Corollary 2.1 states that the maximum and the minimum are attained when $p_1, p_2, \cdots, p_n$ take on, at most, three different values, only one of which is distinct from 0 and 1. Applications of Theorems 3 and 5 to problems of estimation and testing are pointed out in Section 5.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Raghavan, P., & Tompson, C. D. (1987) · Combinatorica · doi:10.1007/bf02579324 · Cited by 1,010
Parallel tree contraction and its application
Miller, G. L., & Reif, J. H. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.43 · Cited by 404
Pseudo-likelihood methods for community detection in large sparse networks
Amini, A. A., Chen, A., Bickel, P. J., & Levina, E. (2013) · The Annals of Statistics · doi:10.1214/13-aos1138 · Cited by 259
Baldwin, C. H., Mayer, K., Brown, N. C., Ryan-Anderson, C., & Hayes, D. (2022) · Quantum · doi:10.22331/q-2022-05-09-707 · Cited by 54
Metadata
- Authors
- Hoeffding, W.
- Venue
- The Annals of Mathematical Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 1956-09
- Volume
- 27
- Issue
- 3
- Pages
- 713-721
- ISSN
- 0003-4851 (ISSN-L)
- OpenAlex
- W2004759812
- Cited by
- 374
- References
- 0
- FWCI
- 0.89
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Distribution of the Number of Successes in Independent Trials. https://app.cochat.ai/papers/10.1214/aoms/1177728178
- The paper
- Hoeffding, W. (1956). On the Distribution of the Number of Successes in Independent Trials. The Annals of Mathematical Statistics. https://doi.org/10.1214/aoms/1177728178
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.