Optimal Concentration of Information Content for Log-Concave Densities
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 (Ann. Probab., 39(4):1528–1543, 2011).
Domains
Functional Analysis [math.FA]
Origin : Files produced by the author(s)
Loading...