Random subshifts of finite type

• Autores: Kevin McGoff
• Localización: Annals of probability: An official journal of the Institute of Mathematical Statistics, ISSN 0091-1798, Vol. 40, Nº. 2, 2012, págs. 648-694
• Idioma: inglés
• DOI: 10.1214/10-AOP636
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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 ω of Bn(X) by independently choosing each word from Bn(X) with some probability α. Let Xω be the (random) SFT built from the set ω. For each 0 ≤ α ≤ 1 and n tending to infinity, we compute the limit of the likelihood that Xω is empty, as well as the limiting distribution of entropy for Xω. For α near 1 and n tending to infinity, we show that the likelihood that Xω 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.