Related papers: The chain relation in sofic subshifts
The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
In this article, we compare the dynamics of the shift map and its induced counterpart on the hyperspace of the shift space. We show that many of the properties of induced shift map can be easily demonstrated by appropriate sequences of…
We develop some aspects of a general theory of presentations of subshifts by labelled directed graphs, in particular by compact graphs. Also considered are synchronization properties of subshifts that lead to presentations by countable…
Let $G$ be a group and let $V$ be an algebraic group over an algebraically closed field. We introduce algebraic group subshifts $\Sigma \subset V^G$ which generalize both the class of algebraic sofic subshifts of $V^G$ and the class of…
Some of the basic properties of any dynamical system can be summarized by a graph. The dynamical systems in our theory run from maps like the logistic map to ordinary differential equations to dissipative partial differential equations. Our…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram, ie the infinite sequence of states of a particular cell of a configuration; in the language of symbolic dynamics one…
The subdivision graph $S(\Sigma)$ of a graph $\Sigma$ is obtained from $\Sigma$ by `adding a vertex' in the middle of every edge of $\Si$. Various symmetry properties of $\S(\Sigma)$ are studied. We prove that, for a connected graph…
Asymptotic properties of discrete, stochastic approximations to hybrid systems, modeled as hybrid inclusions, are studied. First, the internal chain transitivity of omega-limits of solutions is concluded, along with other properties related…
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…
Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…
In this work, for the given adjacency matrix of a graph, we present an algorithm which checks the connectivity of a graph and computes all of its connected components. Also, it is mathematically proved that the algorithm presents all the…
We consider minimal, aperiodic symbolic subshifts and show how to characterize the combinatorial property of bounded powers by means of a metric property. For this purpose we construct a family of graphs which all approximate the subshift…
In this paper, we investigate the dynamical behavior of a two dimensional shift $X_G$ (generated by a two dimensional graph $G=(\mathcal{H},\mathcal{V})$) using the adjacency matrices of the generating graph $G$. In particular, we…
In this paper, we consider different classes of subshifts and study their perturbations obtained by forbidding sequences that contain a given word as a subword. We show that the perturbations of sofic shifts are sofic. Though not true for…
A directed acyclic graph G = (V, E) is pseudo-transitive with respect to a given subset of edges E1, if for any edge ab in E1 and any edge bc in E, we have ac in E. We give algorithms for computing longest chains and demonstrate geometric…
Characterization of real-world complex systems increasingly involves the study of their topological structure using graph theory. Among global network properties, small-world property, consisting in existence of relatively short paths…
In this paper, we introduce and study notions of average chain transitivity, average chain mixing, total average chain transitivity and almost average shadowing property. We also discuss their interrelations.