Generalizations of Efron's theorem

Abstract

In this article, we prove two new versions of a theorem proven by Efron in [Efr65]. Efron's theorem says that if a function φ : R2 → R is non-decreasing in each argument then we have that the function s E[φ(X,Y)|X+Y=s] is non-decreasing. We name restricted Efron's theorem a version of Efron's theorem where φ : R → R only depends on one variable. PFn is the class of functions such as ∀ a1 ≤ ... ≤ an, b1 ≤ ... ≤ bn, (f(ai-bj))1 ≤ i,j ≤ n ≥ 0. The first version generalizes the restricted Efron's theorem for random variables in the PFn class. The second one considers the non-restricted Efron's theorem with a stronger monotonicity assumption. In the last part, we give a more general result of the second generalization of Efron's theorem.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…