Optimal tail comparison under convex majorization

Abstract

Following results of Kemperman and Pinelis, we show that if X and Y are real valued random variables such that E Y<∞ and for all non-decreasing convex :R→ [0,∞), E(X)≤E(Y), then for all s∈R with P\Y>s\≠ 0, P\X≥E(Y:Y>s)\≤P\Y>s\. This bound is sharp in essentially the strictest possible sense: for any such Y and s there exists such an X with P\X≥ E(Y:Y>s)\=P\Y>s\.

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…