Skip to main content Accessibility help
×
Home
Hostname: page-component-5c569c448b-q9r9l Total loading time: 0.239 Render date: 2022-07-03T03:59:39.827Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Thermodynamic formalism for countable Markov shifts

Published online by Cambridge University Press:  01 December 1999

OMRI M. SARIG
Affiliation:
School of Mathematical Sciences, Tel-Aviv University, Israel (e-mail: sarig@math.tau.ac.il)

Abstract

We establish a generalized thermodynamic formalism for topological Markov shifts with a countable number of states. We offer a definition of topological pressure and show that it satisfies a variational principle for the metric entropies. The pressure of $\phi =0$ is the Gurevic entropy. This pressure may be finite even if the topological entropy is infinite. Let $L_\phi$ denote the Ruelle operator for $\phi$. We offer a definition of positive recurrence for $\phi$ and show that it is a necessary and sufficient condition for a Ruelle–Perron–Frobenius theorem to hold: there exist a $\sigma$-finite measure $\nu $, a continuous function $h>0$ and $\lambda >0$ such that $L_\phi ^{*}\nu =\lambda \nu$, $L_\phi h=\lambda h $ and $\lambda ^{-n}L_\phi ^nf\rightarrow h\int f\,d\nu$ for suitable functions $f$. We show that under certain conditions this convergence is uniform and exponential. We prove a decomposition theorem for positive recurrent functions and construct conformal measures and equilibrium measures. We give complete characterization of the situation when the equilibrium measure is a Gibbs measure. We end by giving examples where positive recurrence can be verified. These include functions of the form $$ \phi =\log f\left( \cfrac{1}{x_0+ \cfrac{1}{x_1+\dotsb }}\right), $$ where $f$ is a suitable function on a suitable shift $X$.

Type
Research Article
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)
144
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Thermodynamic formalism for countable Markov shifts
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Thermodynamic formalism for countable Markov shifts
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Thermodynamic formalism for countable Markov shifts
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *