arXiv subjects

Nai-Zhu Huang

Publications and source records attributed to Nai-Zhu Huang.

4 recordsLinked to original sources

arXiv2024

Limit sets, internal chain transitivity and orbital shadowing of tree-shifts defined on Markov-Cayley trees

In this paper, we introduce the concepts of $ω$-limit sets and pseudo orbits for a tree-shift defined on a Markov-Cayley tree, extending the results of tree-shifts defined on $d$-trees [5,6]. Firstly, we establish the relationships between $ω$-limit sets and we introduce a modified definition of $ω$-limit set based on complete prefix sets (Theorems 1.4 and 1.9). Secondly, we introduce the concept of projected pseudo orbits and investigate the concept of the shadowing property (Theorems 1.12 and 1.14).

math.DS↗

arXiv2019

Decidability of irreducible tree shifts of finite type

We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT), we show that the CPC-irreducibility of TSFTs is related to the connectivity of its graph representation, which is a similar result to one-dimensional shifts of finite type.

math.DS↗

arXiv2018

Topological Degree of Shift Spaces on Monoids

This paper considers the topological degree of $G$-shifts of finite type for the case where $G$ is a nonabelian monoid. Whenever the Cayley graph of $G$ has a finite representation and the relationships among the generators of $G$ are determined by a matrix $A$, the coefficients of the characteristic polynomial of $A$ are revealed as the number of children of the graph. After introducing an algorithm for the computation of the degree, the degree spectrum, which is finite, relates to a collection of matrices in which the sum of each row of every matrix is bounded by the number of children of the graph. Furthermore, the algorithm extends to $G$ of finite free-followers.

math.DS↗

arXiv2018

Entropy bifurcation of neural networks on Cayley trees

It has been demonstrated that excitable media with a tree structure performed better than other network topologies, it is natural to consider neural networks defined on Cayley trees. The investigation of a symbolic space called tree-shift of finite type is important when it comes to the discussion of the equilibrium solutions of neural networks on Cayley trees. Entropy is a frequently used invariant for measuring the complexity of a system, and constant entropy for an open set of coupling weights between neurons means that the specific network is stable. This paper gives a complete characterization for entropy spectrum of neural networks on Cayley trees and reveals whether the entropy bifurcates when the coupling weights change.

math.DS↗