Random \(\mathbb{Z}^d\)-shifts of finite type (Q316999): Difference between revisions

This article considers (multidimensional) subshifts of finite type by fixing a size \(n\), then forbidding each pattern of size \(n\), uniformly and independently (according to some parameter \(\alpha\)), and finally letting \(n\) go to infinity. It is shown that such systems are nonempty if and only if \(\alpha\) is bigger than the inverse of the alphabet cardinality. In this case they admit many periodic configurations; typical topological and periodic entropies are also computed, which give evidence that typical subshifts do not have any of the pathological properties that make symbolic dynamics so different in higher dimension than in dimension one. This work generalizes [the first author, Ann. Probab. 40, No. 2, 648--694 (2012; Zbl 1269.37009)] in two ways: by considering any dimension, and also by expliciting convergence rates of entropies.