Factor maps and embeddings for random shifts of finite type
arXiv:1705.00042
Abstract
For any , random shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter , an alphabet , and a scale , one obtains a distribution of random SFTs by randomly and independently forbidding each pattern of shape with probability from the full shift on . We prove two main results concerning random SFTs. First, we establish sufficient conditions on , , and a subshift so that a random SFT factors onto with probability tending to one as tends to infinity. Second, we provide sufficient conditions on , and a subshift so that embeds into a random SFT with probability tending to one as tends to infinity.