On lower bounds for hypergeometric tails
Jianhang Ai, Christos Pelekis

TL;DR
This paper establishes new lower bounds for the probability that a hypergeometric random variable exceeds its expectation, under specific conditions, with auxiliary results of independent interest.
Contribution
It introduces novel lower bounds for hypergeometric tail probabilities and provides auxiliary bounds on tail conditional expectation and mean absolute deviation.
Findings
Proves that \\mathbb{P}(H \\geq \\mathbb{E}(H)) \\geq k/n for n \\geq 8k.
Derives a refined lower bound involving variance and other parameters.
Provides auxiliary bounds on tail conditional expectation and mean absolute deviation.
Abstract
Let be positive integers such that , and let be a hypergeometric random variable counting the number of black marbles in a sample without replacement of size from an urn that contains black and white marbles. It is shown that \[ \mathbb{P}(H \ge \mathbb{E}(H)) \ge k/n\, , \, \text{when} \,\, n\ge 8k \, . \] Furthermore, provided that as well as that , it is shown that \[ \mathbb{P}(H\ge \mathbb{E}(H)) \,\ge\, \frac{e^{-1/12}}{4\sqrt{2}} \cdot \sqrt{\frac{n-1}{n}} \cdot\frac{ \sqrt{\text{Var}(H)} }{1 + \sqrt{1+ \frac{n-1}{n-k}\cdot\text{Var}(H)}}\, . \] Auxiliary results which may be of independent interest include an upper bound on the tail conditional expectation and a lower bound on the mean absolute deviation of the hypergeometric distribution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
