pith. sign in

arxiv: 1503.01570 · v1 · pith:Y4T2VBU4new · submitted 2015-03-05 · 🧮 math.PR · cs.IT· math.IT

A proof of the Shepp-Olkin entropy concavity conjecture

classification 🧮 math.PR cs.ITmath.IT
keywords conjecturecaseconcavityentropymonotonicparametersproofrandom
0
0 comments X
read the original abstract

We prove the Shepp--Olkin conjecture, which states that the entropy of the sum of independent Bernoulli random variables is concave in the parameters of the individual random variables. Our proof is a refinement of an argument previously presented by the same authors, which resolved the conjecture in the monotonic case (where all the parameters are simultaneously increasing). In fact, we show that the monotonic case is the worst case, using a careful analysis of concavity properties of the derivatives of the probability mass function. We propose a generalization of Shepp and Olkin's original conjecture, to consider Renyi and Tsallis entropies.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.