Related papers: Markov-Dyck shifts, neutral periodic points and to…
We will characterize topological conjugacy classes of one-sided topological Markov shifts in terms of the associated Cuntz--Krieger algebras and its gauge actions with potentials.
We consider topological Markov chains (also called Markov shifts) on countable graphs. We show that a transient graph can be extended to a recurrent graph of equal entropy which is either positive recurrent of null recurrent, and we give an…
For a fixed topological Markov shift, we consider measure-preserving dynamical systems of Gibbs measures for 2-locally constant functions on the shift. We also consider isomorphisms between two such systems. We study the set of all…
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel…
There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…
In the study of dynamical systems on networks/graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that…
We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…
We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…
In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In…
\begin{abstract} In this paper, we investigate a shift arising from graph $G$. We prove that any $k$-dimensional shift of finite type can be generated through a $k$-dimensional graph. We investigate the structure of the shift space using…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. In particular, we are interested in…
We establish an equivariant generalization of the Novikov inequalities which allow to estimate the topology of the set of critical points of a closed basic invariant form by means of twisted equivariant cohomology of the manifold. We apply…
Markov diagrams provide a way to understand the structures of topological dynamical systems. We examine the construction of such diagrams for subshifts, including some which do not have any nontrivial Markovian part, in particular Sturmian…
This is a survey on the local structure about a fixed point of discrete finite-dimensional holomorphic dynamical systems, discussing in particular the existence of local topological conjugacies to normal forms, and the structure of local…
We use symplectic tools to establish a smooth variant of Franks theorem for a closed orientable surface of positive genus $g$; it implies that a symplectic diffeomorphism isotopic to the identity with more than $2g-2$ fixed points, counted…
We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate two processes for constructing non-negative topological…
Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…
This paper focuses on flow-adapted point-shifts of point processes on topological groups, which map points of a point process to other points of the point process in a translation invariant way. Foliations and connected components generated…
We introduce a notion of coded equivalence in one-sided topological Markov shifts. The notion is inspired by coding theory. One-sided topological conjugacy implies coded equivalence. We will show that coded equivalence implies continuous…
For continuously orbit equivalent one-sided topological Markov shifts $(X_A,\sigma_A)$ and $(X_B,\sigma_B)$, their eventually periodic points and cocycle functions are studied. As a result we directly construct an isomorphism between their…