Random subshifts of finite type

@inproceedings{Mcgoff2012RandomSO,
  title={Random subshifts of finite type},
  author={Kevin Mcgoff},
  year={2012}
}
  • Kevin Mcgoff
  • Published 2012
  • Mathematics
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS

    Finite Orbits in Random Subshifts of Finite Type

    VIEW 12 EXCERPTS
    CITES BACKGROUND, RESULTS & METHODS
    HIGHLY INFLUENCED

    Pressure and escape rates for random subshifts of finite type.

    VIEW 14 EXCERPTS
    CITES METHODS & BACKGROUND

    RANDOM Zd -SHIFTS OF FINITE TYPE

    VIEW 5 EXCERPTS
    CITES RESULTS, METHODS & BACKGROUND

    Random $\mathbb{Z}^d$-shifts of finite type

    VIEW 5 EXCERPTS
    CITES RESULTS, METHODS & BACKGROUND