Classification of backward filtrations and factor filtrations: examples from cellular automata

@article{Lanthier2021ClassificationOB,
title={Classification of backward filtrations and factor filtrations: examples from cellular automata},
author={Paula A. Lanthier and Thierry DE LA RUE},
journal={Ergodic Theory and Dynamical Systems},
year={2021},
volume={42},
pages={2890 - 2922}
}

Abstract We consider backward filtrations generated by processes coming from deterministic and probabilistic cellular automata. We prove that these filtrations are standard in the classical sense of Vershik’s theory, but we also study them from another point of view that takes into account the measure-preserving action of the shift map, for which each sigma-algebra in the filtrations is invariant. This initiates what we call the dynamical classification of factor filtrations, and the examples… Expand

The object of study of this work is the invariant characteristics of filtrations in discrete, negative time, pioneered by Vershik. We prove the equivalence between I-cosiness and standardness without… Expand

This work presents extensions of the coupling method to small noises when the cellular automaton has some specific properties (hardcore exclusion, nilpotency, permutivity), and proves ergodicity for a small noise.Expand

Using an example of A. Vershik, a class of processes is introduced with the property that they do not admit astandard extension. This provides a simple proof that Vershik's example process does not… Expand

Let (F t ) t≥0 be the filtration of a Brownian motion (B(t))t≥0 on (Ω,F,P). An example is given of a measure Q ∼ P (in the sense of absolute continuity) for which (F t ) t ≥ 0 is not the filtration… Expand