Pressure and escape rates for random subshifts of finite type
Kevin McGoff

TL;DR
This paper investigates how the pressure and escape rates behave in random subshifts of finite type, showing convergence to specific values as the size of forbidden word sets grows and the probability parameter approaches one.
Contribution
It introduces a probabilistic framework for analyzing pressure and escape rates in random subshifts, revealing their asymptotic behavior as the system size increases.
Findings
Pressure converges to P_X(f) + log(α) in probability.
Escape rate converges to -log(α) in probability.
Results hold for α sufficiently close to 1 as n increases.
Abstract
In this work we consider several aspects of the thermodynamic formalism in a randomized setting. Let be a non-trivial mixing shift of finite type, and let be a H\"older continuous potential with associated Gibbs measure . Further, fix a parameter . For each , let be a random subset of words of length , where each word of length that appears in is included in with probability (and excluded with probability ), independently of all other words. Then let be the random subshift of finite type obtained by forbidding the words in from . In our first main result, for sufficiently close to and tending to infinity, we show that the pressure of on converges in probability to the value $P_X(f) +…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
