On lower bounds for hypergeometric tails

Abstract

Let n,k be positive integers such that n≥ k, and let H be a hypergeometric random variable counting the number of black marbles in a sample without replacement of size k from an urn that contains i∈ \1,…, n\ black and n - i white marbles. It is shown that \[ P(H E(H)) k/n\, , \, when \,\, n 8k \, . \] Furthermore, provided that 1 E(H) \i,k\-1 as well as that (n-i)(n-k)n>1, it is shown that \[ P(H E(H)) \,\, e-1/1242 · n-1n · Var(H) 1 + 1+ n-1n-k·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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…