2000 character limit reached
Concentration functions and entropy bounds for discrete log-concave distributions
Published 21 Jul 2020 in math.PR | (2007.11030v2)
Abstract: Two-sided bounds are explored for concentration functions and R\'enyi entropies in the class of discrete log-concave probability distributions. They are used to derive certain variants of the entropy power inequalities.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.