Random subshifts of finite type

From MaRDI portal
Publication:414282

DOI10.1214/10-AOP636zbMATH Open1269.37009arXiv1006.1325OpenAlexW3102416645MaRDI QIDQ414282FDOQ414282

Kevin McGoff

Publication date: 11 May 2012

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: Let X be an irreducible shift of finite type (SFT) of positive entropy, and let Bn(X) be its set of words of length n. Define a random subset omega of Bn(X) by independently choosing each word from Bn(X) with some probability alpha. Let Xomega be the (random) SFT built from the set omega. For each 0leqalphaleq1 and n tending to infinity, we compute the limit of the likelihood that Xomega is empty, as well as the limiting distribution of entropy for Xomega. For alpha near 1 and n tending to infinity, we show that the likelihood that Xomega contains a unique irreducible component of positive entropy converges exponentially to 1. These results are obtained by studying certain sequences of random directed graphs. This version of "random SFT" differs significantly from a previous notion by the same name, which has appeared in the context of random dynamical systems and bundled dynamical systems.


Full work available at URL: https://arxiv.org/abs/1006.1325





Cites Work


Cited In (10)






This page was built for publication: Random subshifts of finite type

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414282)