Pressure and equilibrium states for countable state Markov shifts (Q1852723)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Pressure and equilibrium states for countable state Markov shifts
scientific article

    Statements

    Pressure and equilibrium states for countable state Markov shifts (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2003
    0 references
    The authors consider a directed graph \((V,E)\), where \(V\) is the set of vertices and \(E\) is the set of edges. Both sets \(V\) and \(E\) can be infinite but countable. The graph \(G\) is allowed to have parallel edges and it is irreducible. Then \(G\) defines the noncompact phase space \(X\) for a two-sided transitive Markov shift. In this setting, two definitions of topological pressure of continuous maps \(f:X\rightarrow \mathbb{R}\) are introduced, and it is proved that if \(f\) holds some distorsion properties, both definitions are equivalent. Additionally, an alternative equivalent definition of topological pressure for transitive Markov shifts whose set of vertices is finite is also given. Later on, a variational principle for this notion is studied. Then, they introduce the notion of \(Z\)-recurrence of vertices of the graph, which is used to find the equilibrium states of the map \(f\). A translation of these results for one-sided transitive Markov shifts is also studied, as well as distortion properties of continuous maps \(f:X\rightarrow \mathbb{R}\). The paper ends with an application of this theory to the Gauss map \(T:Y\rightarrow Y\), given by \(Tx=1/x-[1/x]\), where \(Y\) denotes the set of irrational numbers in \((0,1)\) and \([x]\) is the maximal integer less or equal than \(x\). The equilibrium state for the map \(f(x)=-\log |T'(x)|\) is characterized as a limiting measure obtained from measures supported on periodic points.
    0 references
    countable Markov shifts
    0 references
    topological pressure
    0 references
    equilibrium states
    0 references
    coding theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references