A Renyi Entropy Power Inequality for Log-Concave Vectors and Parameters in [0, 1]
Arnaud Marsiglietti, James Melbourne
Abstract
Arnaud Marsiglietti, James Melbourne
Abstract
Using a sharp version of the reverse Young inequality, and a Renyi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors derive a Renyi entropy power inequality for log-concave random vectors when Renyi parameters belong to [0, 1]. A discussion of symmetric decreasing rearrangements of random variables strengthens the inequality and guides the exploration as to its sharpness.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Using a sharp version of the reverse Young inequality, and a Renyi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors derive a Renyi entropy power inequality for log-concave random vectors when Renyi parameters belong to [0, 1]. A discussion of symmetric decreasing rearrangements of random variables strengthens the inequality and guides the exploration as to its sharpness.
Key concepts: Rényi entropy, Mathematics, Entropy power inequality, Entropy (arrow of time), Inequality, Combinatorics, Statistical physics, Statistics