Concentration functions and entropy bounds for discrete log-concave distributions
Preprint
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.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Variants of the Entropy Power InequalityIEEE Transactions on Information Theory, 2017
- A Sharp Uniform Bound for the Distribution of Sums of Bernoulli TrialsCombinatorics, Probability and Computing, 2015
- A New Entropy Power Inequality for Integer-Valued Random VariablesIEEE Transactions on Information Theory, 2014
- On Concentration Functions of Random VariablesJournal of Theoretical Probability, 2013
- Monotonicity, Thinning, and Discrete Versions of the Entropy Power InequalityIEEE Transactions on Information Theory, 2010
- Generalized Entropy Power Inequalities and Monotonicity Properties of InformationIEEE Transactions on Information Theory, 2007
- Preservation of log-concavity on summationESAIM: Probability and Statistics, 2006
- Log‐Concave and Unimodal Sequences in Algebra, Combinatorics, and GeometryaAnnals of the New York Academy of Sciences, 1989
- Chromatic polynomials and logarithmic concavityJournal of Combinatorial Theory, Series B, 1974
- A Lower Bound for a Probability Moment of any Absolutely Continuous Distribution with Finite VarianceThe Annals of Mathematical Statistics, 1952