2000 character limit reached
Countable Markov shifts with exponential mixing (2403.02092v2)
Published 4 Mar 2024 in math.DS
Abstract: We give a set of equivalent conditions for a potential on a Countable Markov Shift to have strong positive recurrence, which is also equivalent to having exponential decay of correlations. A key ingredient of our proofs is quantifying how the shift behaves at its boundary.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.