2000 character limit reached
A new proof of finitary isomorphism for Markov chains (2506.04069v1)
Published 4 Jun 2025 in math.PR and math.DS
Abstract: We give a new proof of a result of Rudolph stating that a countable-state mixing Markov chain with exponential return times is finitarily isomorphic to an IID process. Besides being short and direct, our proof has the added benefit of working for processes of finite or infinite entropy.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
