Random subshifts of finite type
type: Item
instance of: scholarly article
title: Random subshifts of finite type
zbMATH Open document ID: 1269.37009
DOI: 10.1214/10-AOP636
published in: The Annals of Probability
publication date: 2012-05-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/1006.1325
full work available at URL: https://projecteuclid.org/euclid.aop/1332772716
reviewed by: Katarina Janková
Mathematics Subject Classification ID: 37B10
Mathematics Subject Classification ID: 37B40
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 6032939
zbMATH Keywords: random subshift of finite type
zbMATH Keywords: entropy
author: Kevin McGoff
MaRDI profile type: Publication
arXiv ID: 1006.1325
cites work: A parallel algorithmic version of the local lemma
cites work: Percolation on finite graphs and isoperimetric inequalities.
cites work: Spectral analysis of large dimensional random matrices
cites work: UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS
cites work: The undecidability of the domino problem
cites work: Q5288483
cites work: Ruelle's transfer operator for random subshifts of finite type
cites work: Equilibrium states and the ergodic theory of Anosov diffeomorphisms
cites work: UNAVOIDABLE SETS OF CONSTANT LENGTH
cites work: Anosov maps with rectangular holes. Nonergodic cases
cites work: Ergodic properties of Anosov maps with rectangular holes
cites work: Conditionally invariant measures for Anosov maps with small holes
cites work: Invariant measures for Anosov maps with small holes
cites work: Expanding maps of an interval with holes
cites work: Laplacians and the Cheeger inequality for directed graphs
cites work: Markov extensions and conditionally invariant measures for certain logistic maps with small holes
cites work: Markov extensions for dynamical systems with holes: an application to expanding maps of the interval
cites work: Escape rates and physically relevant measures for billiards with small holes
cites work: Escape rates and conditionally invariant measures
cites work: Ergodic theory on compact spaces
cites work: Q3425140
cites work: Q3267900
cites work: Q3286850
cites work: Produits aléatoires d'opérateurs matrices de transfert. (Random products of transfer matrices)
cites work: Uniqueness Theorems for Periodic Functions
cites work: Percolation
cites work: Q3680586
cites work: Unavoidable sets
cites work: Q4010468
cites work: Q5288793
cites work: Fractal Dimensions and Random Transformations
cites work: Perron-Frobenius theorem, large deviations, and random perturbations in random environments
cites work: THERMODYNAMIC FORMALISM FOR RANDOM TRANSFORMATIONS REVISITED
cites work: Q3445168
cites work: Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
cites work: Q4344097
cites work: Perturbations of Shifts of Finite Type
cites work: Q4880559
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Lasota-Yorke maps with holes: Conditionally invariant probability measures and invariant probability measures on the survivor set
cites work: Open Billiards: Invariant and Conditionally Iinvariant Probabilities on Cantor Sets
cites work: Q4221096
cites work: Critical random graphs: Diameter and mixing time
cites work: Entropy and data compression schemes
cites work: Perturbations of multidimensional shifts of finite type
cites work: Chains, entropy, coding
cites work: Q4888784
OpenAlex ID: W3102416645
review text: Let \(\mathcal A\) be a finite set, \(\mathcal F\) be a set of words on \(\mathcal A\) and \(X(\mathcal F)\) be the set of sequences \(x\) in \(\Sigma=\mathcal A^Z\) such that no word in \(\mathcal F\) appears in \(x\). Then \(X(\mathcal F)\) is a subshift, i.e. closed \(\sigma\)-invariant subset of \(\Sigma\), where \(\sigma\) is the left shift. If \(X\) is a subshift and \(X=X(\mathcal F)\), where \(\mathcal F\) is a finite set of words, then \(X\) is a subshift of a finite type (SFT). An SFT \(X\) is irreducible if for every two nonempty open sets \(U\) and \(V\) and every \(N\) there exists \(n\geq N\) such that \(\sigma^n (U)\cap V\neq \emptyset\). The entropy of \(X\) is defined as \(h(X)=\lim \frac{1}{n}\log |B_n(X)|\), where \(B_n(X)\) is the set of all words of length \(n \) that appear in some \(x\in X\).NEWLINENEWLINE Let \(X\) be an irreducible SFT of positive entropy and \(\omega\) be a random subset of \(B_n(X)\) given by choosing every word in \(B_n(X)\) independently with probability \(\alpha\). Let \(X_\omega\) be the random SFT built from the set \(\omega\). The results presented here deal with the likelihood that \(X_\omega\) is empty and with the limiting distribution of entropy of \(X_\omega\). It is also shown that the likelihood for a random SFT to have a unique irreducible component of positive entropy converges exponentially to 1 for \(\alpha\) near 1 and \(n \to \infty\).
description: scientific article; zbMATH DE number 6032939