Entropy-variance inequalities for discrete log-concave random variables via degree of freedom

12/18/2022
by   Heshan Aravinda, et al.
0

We utilize a discrete version of the notion of degree of freedom to prove a sharp min-entropy-variance inequality for integer valued log-concave random variables. More specifically, we show that the geometric distribution minimizes the min-entropy within the class of log-concave probability sequences with fixed variance. As an application, we obtain a discrete Rényi entropy power inequality in the log-concave case, which improves a result of Bobkov, Marsiglietti and Melbourne (2022).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/04/2023

Minimum entropy of a log-concave variable for fixed variance

We show that for log-concave real random variables with fixed variance t...
research
05/21/2020

Reversals of Rényi Entropy Inequalities under Log-Concavity

We establish a discrete analog of the Rényi entropy comparison due to Bo...
research
03/01/2021

Bernoulli sums and Rényi entropy inequalities

We investigate the Rényi entropy of independent sums of integer valued r...
research
02/26/2018

Dimension-free Information Concentration via Exp-Concavity

Information concentration of probability measures have important implica...
research
08/23/2021

Rényi entropy and variance comparison for symmetric log-concave random variables

We show that for any α>0 the Rényi entropy of order α is minimized, amon...
research
11/13/2021

A discrete complement of Lyapunov's inequality and its information theoretic consequences

We establish a reversal of Lyapunov's inequality for monotone log-concav...
research
02/08/2021

Variations on a Theme by Massey

In 1994, James Lee Massey proposed the guessing entropy as a measure of ...

Please sign up or login with your details

Forgot password? Click here to reset