Related papers: Ultragraph shift spaces and chaos
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…
To an arbitrary directed graph we associate a row-finite directed graph whose C*-algebra contains the C*-algebra of the original graph as a full corner. This allows us to generalize results for C*-algebras of row-finite graphs to…
In this work we propose a new type of shift spaces, called blur shift spaces, where one can represent with a single symbol an entire set of infinite symbols. Such shift spaces are constructed from classical shift spaces, by choosing some…
We introduce the definition of Li-Yorke chaos for the map f on G-spaces, and show G-Li-Yorke chaos is iterable for f. Li-Yorke chaos implies G-Li-Yorke chaos, while the converse is not true. Then we give a sufficient condition for f to be…
We study chaotic properties of uniformly convergent nonautonomous dynamical systems. We show that, contrary to the autonomous systems on the compact interval, positivity of topological sequence entropy and occurrence of Li-Yorke chaos are…
In this paper, we develop the basic theory of the shadowing property for local homeomorphisms of metric locally compact spaces, with a focus on applications to edge shift spaces connected with C*-algebra theory. For the local homeomorphism…
This paper establishes some criteria of chaos in non-autonomous discrete systems. Several criteria of strong Li-Yorke chaos are given. Based on these results, some criteria of distributional chaos in a sequence are established. Moreover,…
Periodicity plays a significant role in the chaos theory from the beginning since the skeleton of chaos can consist of infinitely many unstable periodic motions. This is true for chaos in the sense of Devaney [1], Li-Yorke [2] and the one…
In this paper, we study various chaos of topological group or semigroup actions.
For any continuous self-map of a compact metric space, we extend a partition of each chain component with respect to a chain proximal relation to a $G_\delta$-partition of the phase space. Under the assumption of s-limit shadowing, we use…
We study topological entropy of exactly Devaney chaotic maps on totally regular continua, i.e. on (topologically) rectifiable curves. After introducing the so-called P-Lipschitz maps (where P is a finite invariant set) we give an upper…
This paper is concerned with Devaney chaos in non-autonomous discrete systems. It is shown that in its definition, the two former conditions, i.e., transitivity and density of periodic points, in a set imply the last one, i.e., sensitivity,…
The notion of ends in an infinite graph $G$ might be modified if we consider them as equivalence classes of infinitely edge-connected rays, rather than equivalence classes of infinitely (vertex-)connected ones. This alternative definition…
We study discontinuous interval maps generated by the action of erasing block substitutions on the binary expansion. After establishing some general properties of these maps, we categorize erasing block substitutions in a hierarchy of…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
We present a definition of chaotic Delone set, and establish the genericity of chaos in the space of $(\epsilon,\delta)$-Delone sets for $\epsilon\geq \delta$. We also present a hyperbolic analogue of the cut-and-project method that…
The problem of inner vs outer conjugacy of subalgebras of certain graph C*-algebras is investigated. For a large class of finite graphs E, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph…
Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its…
We study types that appear in ultraproducts that have distributions which can be thought of as a sequence of graphs. The property of having distributions that are captured by graphs is motivated by a commonality of $\mathrm{SOP}_2$-types…
We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space $(X, d)$ is ultrametric iff the diametrical graph of the metric $d_{\varepsilon}(x,…