Ergodicity versus non-ergodicity for Probabilistic Cellular Automata on rooted trees
Abstract
In this article we study a class of shift-invariant and positive rate probabilistic cellular automata (PCA) on rooted d-regular trees Td. In a first result we extend the results of [10] on trees, namely we prove that to every stationary measure of the PCA we can associate a space-time Gibbs measure μ on Z × Td. Under certain assumptions on the dynamics the converse is also true. A second result concerns proving sufficient conditions for ergodicity and non-ergodicity of our PCA on d-ary trees for d∈ \ 1,2,3\ and characterizing the invariant product Bernoulli measures.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.