PreprintarXiv licencearXiv
Why Distance Two Is Exceptional for Poisson-Binomial Point Probabilities
Abstract
Let S be a finite sum of independent Bernoulli random variables. We ask how large the mean must be before the atom at k+r can strictly exceed the atom at k. For the threshold Tk,r:=inf{πΌS:β(S=k+r)>β(S=k)}, the adjacent case recovers the classical Darroch boundary k+1/(k+2), while every gap rβ₯3 has threshold k+1. Distance two is the unique nonadjacent exception: Tk,2=k+Ξk, where Ξk and its staircase optimizer are explicit and Ξk=1/2+1/β(2k)β1/(4k)+O(kβ3/2). The proof combines the classical fixed-mean reduction to shifted binomial laws with an exact discrete optimization. The result also yields sharp restrictions on nonadjacent coefficient reversals in real-rooted polynomials with nonnegative coefficients.
Related
- Extended One-Liners for the Gamma, Poisson, and Binomial Distributions
- A Fixed-Point Worpitzky Identity and a Positive Binomial Transform for Type B Involutions
- Poisson empirical Bayes estimation of sums of random variables via minimum-distance methods
- Multiple change-point detection for Poisson processes
- Bayesian Soft-Tree Poisson Process Model for Covariate-Dependent Point Patterns
BibTeX
@misc{kleiner2026distance,
title = {{Why Distance Two Is Exceptional for Poisson-Binomial Point Probabilities}},
author = {Igor Kleiner},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.10664},
eprint = {2610.10664},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.10664},
}
RIS
TY - UNPB
TI - Why Distance Two Is Exceptional for Poisson-Binomial Point Probabilities
AU - Igor Kleiner
PY - 2026
DA - 2026/10/07
PB - arXiv
DO - 10.48550/arxiv.2610.10664
UR - https://arxiv.org/abs/2610.10664
AB - Let S be a finite sum of independent Bernoulli random variables. We ask how large the mean must be before the atom at k+r can strictly exceed the atom at k. For the threshold T_k,r:=inf{πΌS:β(S=k+r)>β(S=k)}, the adjacent case recovers the classical Darroch boundary k+1/(k+2), while every gap rβ₯3 has threshold k+1. Distance two is the unique nonadjacent exception: T_k,2=k+Ξ_k, where Ξ_k and its staircase optimizer are explicit and Ξ_k=1/2+1/β(2k)β1/(4k)+O(k^β3/2). The proof combines the classical fixed-mean reduction to shifted binomial laws with an exact discrete optimization. The result also yields sharp restrictions on nonadjacent coefficient reversals in real-rooted polynomials with nonnegative coefficients.
ER -