Exponential moments of block-size probabilities decide when union-of-random-blocks processes on Z^d are finitary factors of IID and when they are stochastically dominated by non-trivial Bernoulli percolation.
A new proof of finitary isomorphism for Markov chains
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
citation-role summary
method 1
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Finitary codings and stochastic domination for Poisson representable processes
Exponential moments of block-size probabilities decide when union-of-random-blocks processes on Z^d are finitary factors of IID and when they are stochastically dominated by non-trivial Bernoulli percolation.