By Kevin Mcgoff and Ronnie Pavlov

For any *d \geq 1*, random *\mathbb{Z}^d* shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter *\alpha \in [0,1]*, an alphabet *\mathcal{A}*, and a scale *n \in \mathbb{N}*, one obtains a distribution of random *\mathbb{Z}^d* SFTs by randomly and independently forbidding each pattern... Show more

April 28, 2017

Loading full text...

Similar articles

Loading recommendations...

x1

Factor maps and embeddings for random $\mathbb{Z}^d$ shifts of finite type

Click on play to start listening