Finite orbits in random subshifts of finite type

preprint2016arXivOpen access

Abstract

For each n,d∈Nn, d \in \mathbb{N} and 0<α<10 < α< 1, we define a random subset of A{1,2,…,n}d\mathcal{A}^{\{1, 2, \dots, n\}^d} by independently including each element with probability αα and excluding it with probability 1−α1-α, and consider the associated random subshift of finite type. Extending results of McGoff and of McGoff and Pavlov, we prove there exists α0=α(d,∣A∣)>0α_0 = α(d, |\mathcal{A}|) > 0 such that for α<α0α< α_0 and with probability tending to 11 as n→∞n \to \infty, this random subshift will contain only finitely many elements. In the case d=1d = 1, we obtain the best possible such α0α_0, 1/∣A∣1/|\mathcal{A}|.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.