2009
DOI: 10.4064/fm206-0-1
|View full text |Cite
|
Sign up to set email alerts
|

Predictability, entropy and information of infinite transformations

Abstract: We show that a certain type of quasi finite, conservative, ergodic , measure preserving transformation always has a maximal zero entropy factor, generated by predictable sets. We also construct a conservative, ergodic , measure preserving transformation which is not quasi finite; and consider distribution asymptotics of information showing that e.g. for Boole's transformation, information is asymptotically mod-normal with normalization ∝ √ n. Lastly we see that certain ergodic, probability preserving transform… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
24
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(25 citation statements)
references
References 0 publications
1
24
0
Order By: Relevance
“…Translating this result into the Poisson framework yields the following criterion for distality. We now apply our previous results to a question of Aaronson and Park from [2], regarding the existence of a Krengel-Pinsker factor for quasi-finite transformations. First, we note that the assumptions of Theorem 11.3 hold in particular for quasifinite systems:…”
Section: Corollary 122 Assume (X B µ T ) Is Of Type IImentioning
confidence: 92%
See 4 more Smart Citations
“…Translating this result into the Poisson framework yields the following criterion for distality. We now apply our previous results to a question of Aaronson and Park from [2], regarding the existence of a Krengel-Pinsker factor for quasi-finite transformations. First, we note that the assumptions of Theorem 11.3 hold in particular for quasifinite systems:…”
Section: Corollary 122 Assume (X B µ T ) Is Of Type IImentioning
confidence: 92%
“…In [2] and [10] co-finite partitions were considered. With our terminology, these are finite, local partitions.…”
Section: An Upper Bound For the Poisson Entropymentioning
confidence: 99%
See 3 more Smart Citations