Related papers: The chain relation in sofic subshifts
Adaptivity is a dynamical feature that is omnipresent in nature, socio-economics, and technology. For example, adaptive couplings appear in various real-world systems like the power grid, social, and neural networks, and they form the…
Dynamical systems with complex behaviours, e.g. immune system cells interacting with a pathogen, are commonly modelled by splitting the behaviour into different regimes, or modes, each with simpler dynamics, and then learning the switching…
Building on our previous work, we give a thorough presentation of the techniques developed for synchronizing dynamical systems in the special case of synchronizing shift spaces. Following work of Thomsen, we give a construction of the…
The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift $X$ and its associated hom tree-shift $\mathcal{T}_{X}$, as well as the equivalence in the sofic shift. On the…
We investigate the behavior of data structures when the input and operations are generated by an event graph. This model is inspired by Markov chains. We are given a fixed graph G, whose nodes are annotated with operations of the type…
As an extension of positive or almost positive diagrams and links, we introduce a notion of successively almost positive diagrams and links, and good successively almost positive diagrams and links. We review various properties of positive…
Many techniques in harmonic analysis use the fact that a continuous object can be written as a sum (or an intersection) of dyadic counterparts, as long as those counterparts belong to an adjacent dyadic system. Here we generalize the notion…
We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…
Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper,…
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…
Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X --> X is the…
We show that Property $(A)$ of subshifts and the semigroup, that is associated to subshifts with Property (A), are invariants of flow equivalence. We show for certain $\mathcal R$-graphs that their isomorphism is implied by the flow…
Given a connected graph $G$ on $n$ vertices and a positive integer $k\le n$, a subgraph of $G$ on $k$ vertices is called a $k$-subgraph in $G$. We design combinatorial approximation algorithms for finding a connected $k$-subgraph in $G$…
We introduce a novel approach to description of networks/graphs. It is based on an analogue physical model which is dynamically evolved. This evolution depends on the connectivity matrix and readily brings out many qualitative features of…
The structure of the graph defined by the interactions in a Boolean network can determine properties of the asymptotic dynamics. For instance, considering the asynchronous dynamics, the absence of positive cycles guarantees the existence of…
This manuscript considers the following "graph classification" question: given a collection of graphs and associated classes, how can one predict the class of a newly observed graph? To address this question we propose a statistical model…
Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in which two adjacent cycles have at least one common vertex. If…
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…
A shadowable point for a flow is a point where the shadowing lemma holds for pseudo-orbits passing through it. We prove that this concept satisfies the following properties: the set of shadowable points is invariant and a $G_{\delta}$ set.…
We introduce partial group algebras with relations in a purely algebraic framework. Given a group and a set of relations, we define an algebraic partial action and prove that the resulting partial skew group ring is isomorphic to the…