Thinning, Entropy and the Law of Thin Numbers

Details Thinning, Entropy and the Law of Thin Numbers Thinning, Entropy and the Law of Thin Numbers

2009-06-03

arxiv.org/abs/0906.0690v1

IEEE Transactions on Information Theory, Vol 56/9, 2010, pages 4228-4244

Computer Science

Information Theory

Scientific paper

10.1109/TIT.2010.2053893

Renyi's "thinning" operation on a discrete random variable is a natural discrete analog of the scaling operation for continuous random variables. The properties of thinning are investigated in an information-theoretic context, especially in connection with information-theoretic inequalities related to Poisson approximation results. The classical Binomial-to-Poisson convergence (sometimes referred to as the "law of small numbers" is seen to be a special case of a thinning limit theorem for convolutions of discrete distributions. A rate of convergence is provided for this limit, and nonasymptotic bounds are also established. This development parallels, in part, the development of Gaussian inequalities leading to the information-theoretic version of the central limit theorem. In particular, a "thinning Markov chain" is introduced, and it is shown to play a role analogous to that of the Ornstein-Uhlenbeck process in connection to the entropy power inequality.

Affiliated with

Also associated with

No associations

Rating

Thinning, Entropy and the Law of Thin Numbers 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 Thinning, Entropy and the Law of Thin Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Thinning, Entropy and the Law of Thin Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193937