Concentration functions and entropy bounds for discrete log-concave distributions
- 27 May 2021
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 31 (1) , 54-72
Abstract
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.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- A Sharp Uniform Bound for the Distribution of Sums of Bernoulli TrialsCombinatorics, Probability and Computing, 2015
- Entropy Power Inequality for the Rényi EntropyIEEE Transactions on Information Theory, 2014
- Bounds on the Maximum of the Density for Sums of Independent Random VariablesJournal of Mathematical Sciences, 2014
- 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
- Preservation of log-concavity on summationESAIM: Probability and Statistics, 2006
- On Solutions to Multivariate Maximum α-Entropy Problems2003
- 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