Entropy on regular trees (Q2176549): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3016015984 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1909.05153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Conjugacy of Tree-Shifts of Finite Type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sofic and Almost of Finite Type Tree-Shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-shifts of finite type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sofic tree-shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree algebra of sofic tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropic aspects of random fields on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BRIEF INTRODUCTION TO SOFIC ENTROPY THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic theory on compact spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential cavity method for computing free energy and surface pressure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the entropies of multidimensional shifts of finite type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Sampling of Subshifts of Finite Type on Grids and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating entropy for a class of ℤ<sup>2</sup>Markov random fields and pressure for a class of functions on ℤ<sup>2</sup>shifts of finite type / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independence and entropy for high-dimensional isotropic subshifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the hard square entropy constant with probabilistic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy on regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree shift topological entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic dynamics on free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220558 / rank
 
Normal rank

Latest revision as of 13:54, 22 July 2024

scientific article
Language Label Description Also known as
English
Entropy on regular trees
scientific article

    Statements

    Entropy on regular trees (English)
    0 references
    5 May 2020
    0 references
    Let \(k\geq 2\) and let \(\Sigma_k =\{0,1, \dots, k-1\}\). The set \(\Sigma_k^{*}\) of all finite words on the alphabet \(\Sigma_k\) is the \(k\)-tree, which is naturally visualized as the Cayley graph of the free semigroup on \(k\) generators. The function \(\sigma: \Sigma_k^{*} \rightarrow A\) is called labeled tree, where \(A =\{0,1, \dots, d-1\}\) is an alphabet on \(d\) symbols, \(d\geq 2\). In the present paper the authors prove that the limit in the definition of tree shift topological entropy is actually the infimum: \[ h(\tau )=\lim_{n\rightarrow \infty } \frac{\log p_{\tau}(n)}{1+k+\cdots +k^n}=\inf \left\{\frac{\log p_{\tau}(n)}{1+k+\cdots +k^n}:n\in \mathbb{N}\right\},\] where \(h(\tau)\) is the topological entropy of the labeled tree \(\tau\). Let \(X\subset A^{\mathbb{Z}}\) be a subshift on a finite alphabet, let \(k = 2\), and let \(Z(X)\) be the tree shift on the binary tree associated with \(X\). The authors prove that \(h_{\text{top}}(X)\leq h(Z(X))\). By using the strip method for the golden mean shift of finite type on the \(k\)-tree, \(k\geq 2\), the authors show that the entropy \(h^{(k)}\) is strictly increasing in \(k\). Then, for each fixed \(k = 2, 3,\dots,\) the authors prove that the site specific strip approximation entropies \(h^{(k)}_n\) converge to the entropy \(h^{(k)}\) of the golden mean SFT on the \(k\)-tree. For all \(k\geq 2\), the entropy of the golden mean SFT on the \(k\)-tree is given by a formula. The authors study the monotonicity of the strip approximation entropies for \(k = 2,\dots, 8\). By means of some numerical calculations, they show that these approximations increase strictly with \(n\). They also show that the intermediate entropy \(h^{i} = \lim_{n\rightarrow \infty}\frac{\log (q(n))}{n}\) exists. An infinite series formula of the entropy of the \(k\)-tree shift corresponding to an irreducible \(d\times d\) (0,1)-matrix \(M\) is given. It is shown that \(h^{i}(Z) = h(Z)\). In the last section, by using the strip method, the authors study the topological entropy \(h(Z_M)\) of the system \(Z_M\).
    0 references
    0 references
    tree shift
    0 references
    complexity function
    0 references
    entropy
    0 references
    0 references
    0 references

    Identifiers

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