On the Correspondence between Subshifts of Finite Type and Statistical Mechanics Models.

Entropy (Basel)

Instituto de Física, Universidad Autónoma de San Luis Potosí, San Luis Potosi 78250, Mexico.

Published: December 2022

Several classical problems in symbolic dynamics concern the characterization of the simplex of measures of maximal entropy. For subshifts of finite type in higher dimensions, methods of statistical mechanics are ideal for dealing with these problems. R. Burton and J. Steif developed a strategy to construct examples of strongly irreducible subshifts of finite type admitting several measures of maximal entropy. This strategy exploits a correspondence between equilibrium statistical mechanics and symbolic dynamics-a correspondence which was later formalized by O. Häggström. In this paper, we revisit and discuss this correspondence with the aim of presenting a simplified version of it and present some applications of rigorous results concerning the Potts model and the six-vertex model to symbolic dynamics, illustrating in this way the possibilities of this correspondence.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9777987PMC
http://dx.doi.org/10.3390/e24121772DOI Listing

Publication Analysis

Top Keywords

subshifts finite
12
finite type
12
statistical mechanics
12
symbolic dynamics
8
measures maximal
8
maximal entropy
8
correspondence
5
correspondence subshifts
4
type statistical
4
mechanics models
4

Similar Publications

On the Correspondence between Subshifts of Finite Type and Statistical Mechanics Models.

Entropy (Basel)

December 2022

Instituto de Física, Universidad Autónoma de San Luis Potosí, San Luis Potosi 78250, Mexico.

Several classical problems in symbolic dynamics concern the characterization of the simplex of measures of maximal entropy. For subshifts of finite type in higher dimensions, methods of statistical mechanics are ideal for dealing with these problems. R.

View Article and Find Full Text PDF

We analyze symbolic dynamics to infinite alphabets by endowing the alphabet with the cofinite topology. The topological entropy is shown to be equal to the supremum of the growth rate of the complexity function with respect to finite subalphabets. For the case of topological Markov chains induced by countably infinite graphs, our approach yields the same entropy as the approach of Gurevich We give formulae for the entropy of countable topological Markov chains in terms of the spectral radius in l2.

View Article and Find Full Text PDF

We introduce the mathematical concept of multifractality and describe various multifractal spectra for dynamical systems, including spectra for dimensions and spectra for entropies. We support the study by providing some physical motivation and describing several nontrivial examples. Among them are subshifts of finite type and one-dimensional Markov maps.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!