By Topic

On the Maximum Entropy Properties of the Binomial Distribution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yaming Yu ; Dept. of Stat., Univ. of California, Irvine, CA

It is shown that the Binomial(n,p) distribution maximizes the entropy in the class of ultra-log-concave distributions of order n with fixed mean np. This result, which extends a theorem of Shepp and Olkin (1981), is analogous to that of Johnson (2007), who considers the Poisson case. The proof constructs a Markov chain whose limiting distribution is Binomial(n,p) and shows that the entropy never decreases along the iterations of this Markov chain.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 7 )