A new proof of finitary isomorphism for Markov chains

2025/06/04 by Yinon Spinka, Spinka, Yinon · 1 citation
Business, Management and Accounting · Computer Science · Mathematics · #Advanced Queuing Theory Analysis #Dynamical Systems (math.DS) #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Petri Nets in System Modeling #Probability (math.PR)

paper · pdf · doi:10.48550/arxiv.2506.04069

openalex publication_date 2025/06/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Finitary codings and stochastic domination for Poisson representable processes

Related

• Finitary isomorphisms of some infinite entropy Bernoulli flows
• Moment-optimal finitary isomorphism for i.i.d. processes of equal entropy
• Entropy-efficient finitary codings
• Lectures on Isomorphism Theorems
• Markovian loop soups: permanental processes and isomorphism theorems