Reversals of Rényi Entropy Inequalities under Log-Concavity
arXiv:2005.10930
Abstract
We establish a discrete analog of the Rényi entropy comparison due to Bobkov and Madiman. For log-concave variables on the integers, the min entropy is within log e of the usual Shannon entropy. Additionally we investigate the entropic Rogers-Shephard inequality studied by Madiman and Kontoyannis, and establish a sharp Rényi version for certain parameters in both the continuous and discrete cases
References in corpus (11)
- The entropy per coordinate of a random vector is highly constrained under convexity conditions
- Log-concavity and the maximum entropy property of the Poisson distribution
- Forward and Reverse Entropy Power Inequalities in Convex Geometry
- Optimal Concentration of Information Content For Log-Concave Densities
- Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures
- Entropy bounds on abelian groups and the Ruzsa divergence
- A lower bound on the differential entropy of log-concave random vectors with applications
- On the problem of reversibility of the entropy power inequality
- Rogozin's convolution inequality for locally compact groups
- Rényi Entropy Power Inequalities via Normal Transport and Rotation
- Rényi entropy power inequality and a reverse