Concentration functions and entropy bounds for discrete log-concave distributions

Sergey G. Bobkov, Arnaud Marsiglietti, James C Melbourne

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)54-72
Number of pages19
JournalCombinatorics Probability and Computing
Issue number1
StateAccepted/In press - 2021

Bibliographical note

Publisher Copyright:
© The Author(s), 2021. Published by Cambridge University Press.


Dive into the research topics of 'Concentration functions and entropy bounds for discrete log-concave distributions'. Together they form a unique fingerprint.

Cite this