The Central Limit Theorem for uniformly strong mixing measures

Details The Central Limit Theorem for uniformly strong mixing measures The Central Limit Theorem for uniformly strong mixing measures

2009-03-07

arxiv.org/abs/0903.1325v1

Mathematics

Dynamical Systems

Scientific paper

The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is finite). In this paper we prove that the measure of cylinder sets are lognormally distributed for strongly mixing systems and infinite partitions and show that the rate of convergence is polynomial provided the fourth moment of the information function is finite. Also, unlike previous results by Ibragimov and others which only apply to finite partitions, here we do not require any regularity of the conditional entropy function. We also obtain the law of the iterated logarithm and the weak invariance principle for the information function.

Affiliated with

Also associated with

No associations

Rating

The Central Limit Theorem for uniformly strong mixing 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 The Central Limit Theorem for uniformly strong mixing measures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Central Limit Theorem for uniformly strong mixing measures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670628