Concentration functions and entropy bounds for discrete log-concave distributions

Two-sided bounds are explored for concentration functions and Rényi entropies in the class of discrete log-concave probability distributions. They are used to derive certain variants of the entropy power inequalities.

Saved in:
Bibliographic Details
Published in:Combinatorics, probability & computing probability & computing, 2022-01, Vol.31 (1), p.54-72
Main Authors: Bobkov, Sergey G., Marsiglietti, Arnaud, Melbourne, James
Format: Article
Language:English
Subjects:
Combinatorics
Entropy
Entropy (Information theory)
Inequality
Random variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two-sided bounds are explored for concentration functions and Rényi entropies in the class of discrete log-concave probability distributions. They are used to derive certain variants of the entropy power inequalities.
ISSN:0963-5483
1469-2163
DOI:10.1017/S096354832100016X