paper

Optimal tail comparison under convex majorization

arXiv:2207.01872

Abstract

Following results of Kemperman and Pinelis, we show that if and are real valued random variables such that and for all non-decreasing convex , , then for all with , . This bound is sharp in essentially the strictest possible sense: for any such and there exists such an with .

9 pages. Most of the material here was originally part of arXiv:2203.12523 and/or arXiv:1812.10938 and now stands as a paper on its own

Optimal tail comparison under convex majorization · wovepaper