Finitely dependent processes are finitary

DOI10.1214/19-AOP1417zbMath1453.60150arXiv1901.00123OpenAlexW3045155377MaRDI QIDQ782416

Yinon Spinka

Publication date: 27 July 2020

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.00123

zbMATH Keywords

entropyfinitary factoramenable graphfinitely dependent

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Markov processes (60J99) Measure-theoretic ergodic theory (28D99)

Related Items (5)

Stationary distributions for the Voter model in \(d\geq 3\) are factors of IID ⋮ Mallows permutations and finite dependence ⋮ Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics ⋮ One-dependent colorings of the star graph ⋮ Ising model on trees and factors of IID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of 1-dependent Markov chains
• A class of finitary codes
• Bernoulli schemes of the same entropy are finitarily isomorphic
• Group-invariant percolation on graphs
• On 1-dependent processes and \(k\)-block factors
• Infinite clusters in dependent automorphism invariant percolation on trees
• On the existence and nonexistence of finitary codings for a class of random fields
• Finitary coloring
• An algebraic construction of a class of one-dependent processes
• Finitely dependent cycle coloring
• Finitary coding for the sub-critical Ising model with finite expected coding volume
• Mallows permutations and finite dependence
• One-dependent coloring by finitary factors
• Symmetric 1-dependent colorings of the integers
• FINITELY DEPENDENT COLORING
• Universal finitary codes with exponential tails
• A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
• Factors of IID on Trees

This page was built for publication: Finitely dependent processes are finitary