On the convex infimum convolution inequality with optimal cost function
arXiv:1702.07321 · doi:10.30757/ALEA.v14-39
Abstract
We show that every symmetric random variable with log-concave tails satisfies the convex infimum convolution inequality with an optimal cost function (up to scaling). As a result, we obtain nearly optimal comparison of weak and strong moments for symmetric random vectors with independent coordinates with log-concave tails.
arXiv comment11 pages
References in corpus (8)
- On the infimum convolution inequality
- A short proof of Paouris' inequality
- A note on suprema of canonical processes based on random variables with regular moments
- Comparison of weak and strong moments for vectors with independent coordinates
- A characterization of a class of convex log-Sobolev inequalities on the real line
- Weak and strong moments of l_r-norms of log-concave vectors
- A note on the convex infimum convolution inequality
- Characterization of a class of weak transport-entropy inequalities on the line