Related papers: Maximizing measures for countable alphabet shifts …

We prove that if $\Sigma_{\mathbf A}(\mathbb N)$ is an irreducible Markov shift space over $\mathbb N$ and $f:\Sigma_{\mathbf A}(\mathbb N) \rightarrow \mathbb R$ is coercive with bounded variation then there exists a maximizing probability…

In this work we propose a new type of shift spaces, called blur shift spaces, where one can represent with a single symbol an entire set of infinite symbols. Such shift spaces are constructed from classical shift spaces, by choosing some…

In this article, we study the pressure at infinity of potentials defined over countable Markov shifts. We establish an upper semi-continuity result concerning the limiting behaviour of the pressure of invariant probability measures, where…

Let $\sigma:\boldsymbol{\Sigma}\to\boldsymbol{\Sigma}$ be the left shift acting on $ \boldsymbol{\Sigma} $, a one-sided Markov subshift on a countable alphabet. Our intention is to guarantee the existence of $\sigma$-invariant Borel…

For transitive Markov subshifts over countable alphabets, this note ensures that a dense subclass of locally H\"older continuous potentials admits at most a single periodic probability as a maximizing measure. We resort to concepts…

We study a compactification of the space of invariant probability measures for a transitive countable Markov shift. We prove that it is affine homeomorphic to the Poulsen simplex. Furthermore, we establish that, depending on a combinatorial…

Given a two-sided shift space on a finite alphabet and a continuous potential function, we give conditions under which an equilibrium measure can be described using a construction analogous to Hausdorff measure that goes back to the work of…

In the paper we are dealing with metric measure spaces of diameter at most one and of total measure one. Gromov introduced the sampling compactification of the set of these spaces. He asked whether the metric measure space invariants extend…

We prove that the entropy map for countable Markov shifts of finite entropy is upper semi-continuous at ergodic measures. Note that the phase space is non-compact. Applications to systems that can be coded by these shifts, such as positive…

We study approximation schemes for shift spaces over a finite alphabet using (pseudo)metrics connected to Ornstein's $\bar{d}$ metric. This leads to a class of shift spaces we call $\bar{d}$-approachable. A shift space…

Ott, Tomforde, and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea we develop a notion of two-sided shift spaces over infinite alphabets, with an eye towards generalizing a…

We show that a shift space on a finite alphabet with a non-uniform specification property can be modeled by a strongly positive recurrent countable-state Markov shift to which every equilibrium state lifts. In addition to uniqueness of the…

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of…

We study the thermodynamic formalism for particular types of sub-additive sequences on a class of subshifts over countable alphabets. The subshifts we consider include factors of irreducible countable Markov shifts under certain conditions.…

For full shifts on finite alphabets, Coelho and Quas showed that the map that sends a H\"older continuous potential $\phi$ to its equilibrium state $\mu_\phi$ is $\overline{d}$-continuous. We extend this result to the setting of full shifts…

It is well known that the space of invariant probability measures for transitive sub-shifts of finite type is a Poulsen simplex. In this article we prove that in the non-compact setting, for a large family of transitive countable Markov…

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…

We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…

We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…