Metraipolis › archive › dc_7da85db8b27c
Least-Favorable Location for Binomial Top-$t$ Selection — arXiv:2609.03466
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03466
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T02:31:00.708Z
- SHA-256 of the archived text
200068a64d6f33647558ea65caf3f64b995ac1b907453c9324eabbd0e0782997- Stable URL of this page
https://metraipolis.com/documento/dc_7da85db8b27c
How to cite
Least-Favorable Location for Binomial Top-$t$ Selection — arXiv:2609.03466 — arXiv (en), https://arxiv.org/abs/2609.03466 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7da85db8b27c (Metraipolis archive dc_7da85db8b27c, sha256 200068a64d6f33647558ea65caf3f64b995ac1b907453c9324eabbd0e0782997)
BibTeX
@misc{dc7da85db8b27c,
title = {Least-Favorable Location for Binomial Top-$t$ Selection — arXiv:2609.03466},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03466},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7da85db8b27c; sha256 200068a64d6f33647558ea65caf3f64b995ac1b907453c9324eabbd0e0782997},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03466. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Consider $k$ independent Bernoulli populations, each sampled $n$ times, and select the $t$ populations with the largest success counts, breaking ties uniformly. Classical monotonicity reduces the worst case over the preference zone with separation $\delta$ to the slippage family with levels $p$ and $p+\delta$, leaving only its absolute location $p\in[0,1-\delta]$ undetermined. A Gaussian approximation suggests the symmetric center $p_{\mathrm c}=(1-\delta)/2$, and the exact two-population problem is uniquely centered there for every $n\ge2$. For fixed $k,t$ and $\delta\in(0,1)$, we prove that exact eventual centering holds precisely when $k=2t$. When $k\ne2t$, the least-favorable location $p_{n,k,t}^*$ satisfies \[ p_{n,k,t}^*-p_{\mathrm c} =(k-2t)C_\delta n^{-1/2}e^{-n\Gamma_\delta}\{1+o(1)\}, \] where $C_\delta$ and $\Gamma_\delta$ are explicit and positive. In either case, the least-favorable location is eventually unique. The proof writes incorrect selection as a union of pairwise misrankings and applies inclusion--exclusion, yielding a bipartite graph expansion. A single misranking has its exact maximum at the symmetric center and determines the central curvature; two-edge intersections sharing one population determine the central slope through their multiplicity imbalance; all remaining graphs have higher large-deviation rates.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.ST).
Categorie arXiv: Probability (math.PR) ; Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.03466 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T02:08:32.307Z dalla pagina https://arxiv.org/catchup/math.ST/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).