Computer Science – Information Theory
Scientific paper
2008-05-27
Computer Science
Information Theory
Scientific paper
Motivated, in part, by the desire to develop an information-theoretic foundation for compound Poisson approximation limit theorems (analogous to the corresponding developments for the central limit theorem and for simple Poisson approximation), this work examines sufficient conditions under which the compound Poisson distribution has maximal entropy within a natural class of probability measures on the nonnegative integers. We show that the natural analog of the Poisson maximum entropy property remains valid if the measures under consideration are log-concave, but that it fails in general. A parallel maximum entropy result is established for the family of compound binomial measures. The proofs are largely based on ideas related to the semigroup approach introduced in recent work by Johnson for the Poisson family. Sufficient conditions are given for compound distributions to be log-concave, and specific examples are presented illustrating all the above results.
Johnson Oliver
Kontoyiannis Ioannis
Madiman Mokshay
No associations
LandOfFree
On the entropy and log-concavity of compound Poisson measures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the entropy and log-concavity of compound Poisson measures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the entropy and log-concavity of compound Poisson measures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-273605