Uniform Sampling of Subshifts of Finite Type on Grids and Trees

DOI10.1142/S0129054117500174zbMath1382.37016MaRDI QIDQ5268396

Jean Mairesse, Irène Marcovici

Publication date: 20 June 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

subshift of finite typeMarkov random fieldrandom samplingprobabilistic cellular automata

Mathematics Subject Classification ID

Related Items (7)

Tree shift topological entropy ⋮ Topological entropy for shifts of finite type over \(\mathbb{Z}\) and trees ⋮ Entropy on regular trees ⋮ Asymptotic pressure on some self-similar trees ⋮ Characterization and topological behavior of homomorphism tree-shifts ⋮ On structure of topological entropy for tree-shift of finite type ⋮ Percolation games, probabilistic cellular automata, and the hard-core model

Cites Work

• A Mathematical Theory of Communication
• Countable state space Markov random fields and Markov chains on trees
• Reconstruction on trees and spin glass transition
• Percolation and the hard-core lattice gas model
• New results on measures of maximal entropy
• The Dobrushin-Shlosman phase uniqueness criterion and applications to hard squares
• Tree algebra of sofic tree languages
• Non-abelian free group actions: Markov processes, the Abramov–Rohlin formula and Yuzvinskii’s formula
• Approximating entropy for a class of ℤ²Markov random fields and pressure for a class of functions on ℤ²shifts of finite type

This page was built for publication: Uniform Sampling of Subshifts of Finite Type on Grids and Trees