2000 character limit reached
Optimal Concentration of Information Content For Log-Concave Densities
Published 17 Aug 2015 in math.PR, cs.IT, math.FA, and math.IT | (1508.04093v2)
Abstract: An elementary proof is provided of sharp bounds for the varentropy of random vectors with log-concave densities, as well as for deviations of the information content from its mean. These bounds significantly improve on the bounds obtained by Bobkov and Madiman ({\it Ann. Probab.}, 39(4):1528--1543, 2011).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.