相关论文: Markov-Dyck shifts, neutral periodic points and to…
We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck…
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
We show that strongly positively recurrent Markov shifts (in particular shifts of finite type) are classified up to Borel conjugacy by their entropy, period and their numbers of periodic points.
For a given finite directed graph $G$, there are two types of Markov-Dyck shifts, the Markov-Dyck shift $D_G^V$ of vertex type and the Markov-Dyck shift $D_G^E$ of edge type. It is shown that, if $G$ does not have multi-edges, the former is…
We will characterize topological conjugate one-sided topological Markov shifts in terms of their subgroups of continuous full groups and subalgebras of Cuntz--Krieger algebras.
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
We consider families of coded systems that contain the Dyck shifts and that are closed under topological conjugacy. We introduce a notion of hyposynchronization of subshifts. We introduce a notion of restricted complexity of…
We study Markov multi-maps of the interval from the point of view of topological dynamics. Specifically, we investigate whether they have various properties, including topological transitivity, topological mixing, dense periodic points, and…
In this research paper, weighted / unweighted, directed / undirected graphs are associated with interesting Discrete Time Markov Chains (DTMCs) as well as Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of such…
Countable state Markov shifts are a natural generalization of the well-known subshifts of finite type. They are the subject of current research both for their own sake and as models for smooth dynamical systems. In this paper, we…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
It is a question of Hochman whether any two one-dimensional topologically mixing subshifts of finite type (SFTs) with the same entropy are topologically conjugate when their periodic points are removed. We give a negative answer, in fact we…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
We give two new conditions on topological $k$-graphs that are equivalent to the Yeend's aperiodicity Condition (A). Each of the new conditions concerns finite paths rather than infinite. We use a specific example, resulting from a new…
We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
A $D_{\infty}$-topological Markov chain can be represented by a pair of zero-one square matrices, which is called a flip pair. We introduce the concepts of $D_{\infty}$-strong shift equivalence and $D_{\infty}$-shift equivalence, which are…
We study discrete flow equivalence of two-sided topological Markov shifts by using extended Ruelle algebras. We characterize flow equivalence of two-sided topological Markov shifts in terms of conjugacy of certain actions weighted by…
The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…