Approximating the hard square entropy constant with probabilistic methods
From MaRDI portal
(Redirected from Publication:693710)
Abstract: For any two-dimensional nearest neighbor shift of finite type X and any integer n > 0, one can define the horizontal strip shift H_n(X) to be the set of configurations on Z x {1,...,n} which do not contain any forbidden transitions for X. It is always the case that the sequence h(H_n(X))/n of normalized topological entropies of the strip shifts approaches h(X), the topological entropy of X. In this paper, we use probabilistic methods from interacting particle systems to show that for the two-dimensional hard square shift H, in fact h(H_{n+1}(H)) - h(H_n(H)) also approaches h(H), and the rate of convergence is at least exponential. A consequence of this is that h(H) is computable to any tolerance 1/n in time polynomial in n. We also give an example of a two-dimensional block gluing nearest neighbor shift of finite type Y for which h(H_{n+1}(Y)) - h(H_n(Y)) does not even approach a limit.
Recommendations
- Approximating entropy for a class of \(\mathbb Z^2\) Markov random fields and pressure for a class of functions on \(\mathbb Z^2\) shifts of finite type
- Entropy on regular trees
- Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
- On the entropy of \(\mathbb{Z}^d\) subshifts of finite type
- A characterization of the entropies of multidimensional shifts of finite type
Cites work
- scientific article; zbMATH DE number 4066104 (Why is no real title available?)
- scientific article; zbMATH DE number 3745547 (Why is no real title available?)
- scientific article; zbMATH DE number 48343 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3574575 (Why is no real title available?)
- scientific article; zbMATH DE number 4123763 (Why is no real title available?)
- scientific article; zbMATH DE number 3996823 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- A characterization of the entropies of multidimensional shifts of finite type
- A class of $\mathbb {Z}^d$ shifts of finite type which factors onto lower entropy full shifts
- A lower bound for the critical probability of the square lattice site percolation
- A new lower bound for the critical probability of site percolation on the square lattice
- A subshift of finite type that is equivalent to the Ising model
- An Introduction to Symbolic Dynamics and Coding
- An upper bound on the critical percolation probability for the three- dimensional cubic lattice
- Coexistence of the infinite (*) clusters: ? A remark on the square lattice site percolation
- Dimer problem in statistical mechanics-an exact result
- Entropy bounds for constrained two-dimensional random fields
- Factoring higher-dimensional shifts of finite type onto the full shift
- Intrinsic Markov Chains
- Morphisms from non-periodic $\mathbb{Z}^2$ subshifts II: constructing homomorphisms to square-filling mixing shifts of finite type
- Morphisms from non-periodic \mathbb{Z}^{2} subshifts I: constructing embeddings from homomorphisms
- Multidimensional cellular automata and generalization of Fekete's Lemma
- Multidimensional sofic shifts without separation and their factors
- New results on measures of maximal entropy
- Non-uniqueness of measures of maximal entropy for subshifts of finite type
- On phase transitions for subshifts of finite type
- On the entropy of \(\mathbb{Z}^d\) subshifts of finite type
- Percolation
- Percolation and the hard-core lattice gas model
- Percolation with several defect types. An estimate of critical probability for a square lattice
- Planar lattice gases with nearest-neighbor exclusion
- Sequential cavity method for computing free energy and surface pressure
- Stochastic inequalities on partially ordered spaces
- Subsystem entropy for \(\mathbb {Z}^{d}\) sofic shifts
- The Existence of Probability Measures with Given Marginals
- The Number of Independent Sets in a Grid Graph
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- The undecidability of the domino problem
Cited in
(18)- Expansive multiparameter actions and mean dimension
- Four-cycle free graphs, height functions, the pivot property and entropy minimality
- The Complexity of Approximating the Entropy
- An approach to chemical hardness through Shannon's entropy
- Effect of quantified irreducibility on the computability of subshift entropy
- An SMB approach for pressure representation in amenable virtually orderable groups
- Gardens of Eden in the game of life
- A complete proof that square ice entropy is
- Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
- Asymptotic pressure on some self-similar trees
- Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices
- Entropy on regular trees
- Tree shift topological entropy
- Hard Core via PCA: Entropy Bounds
- Seas of squares with sizes from a \(\Pi_{1}^{0}\) set
- Capacity of higher-dimensional constrained systems
- Boundary complexity and surface entropy of 2-multiplicative integer systems on Nd
- The topological strong spatial mixing property and new conditions for pressure approximation
This page was built for publication: Approximating the hard square entropy constant with probabilistic methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693710)
