A two-step entropy-matching construction proves that countable-state mixing renewal processes with exponential return times are finitarily isomorphic to IID processes, including the infinite-entropy case.
A case of isomorphism of Bernoulli schemes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A new proof of finitary isomorphism for Markov chains
A two-step entropy-matching construction proves that countable-state mixing renewal processes with exponential return times are finitarily isomorphic to IID processes, including the infinite-entropy case.