Related papers: The chain relation in sofic subshifts
The spatial preferred attachment (SPA) model is a model for networked information spaces such as domains of the World Wide Web, citation graphs, and on-line social networks. It uses a metric space to model the hidden attributes of the…
Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based…
We provide an explicit S-adic representation of rank one subshifts with bounded spacers and call the subshifts obtained in this way ''Ferenczi subshifts''. We aim to show that this approach is very convenient to study the dynamical behavior…
Signed graphs are an emergent way of representing data in a variety of contexts where antagonistic interactions exist. These include data from biological, ecological, and social systems. Here we propose the concept of communicability for…
We show that graphs, networks and other related discrete model systems carry a natural supersymmetric structure, which, apart from its conceptual importance as to possible physical applications, allows to derive a series of spectral…
In a signed graph each edge has a sign, $+1$ or $-1$. We introduce in the present paper a new definition of connection in a signed graph by the existence of both positive and negative chains between vertices. We prove some results and…
We study the synchronization properties of a generic networked dynamical system, and show that, under a suitable approximation, the transition to synchronization can be predicted with the only help of eigenvalues and eigenvectors of the…
We study the limiting behavior of a random dynamic system driven by a stochastic chain. Our main interest is in the chains that are not necessarily ergodic but rather decomposable into ergodic classes. To investigate the conditions under…
This paper studies topological definitions of chain recurrence and shadowing for continuous endomorphisms of topological groups generalizing the relevant concepts for metric spaces. It is proved that in this case the sets of chain recurrent…
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
In this note we study a family of graphs of groups over arbitrary base graphs where all vertex groups are isomorphic to a fixed countable sofic group $G$, and all edge groups $H<G$ are such that the embeddings of $H$ into $G$ are identical…
Let $G$ be a $p$-group. We begin to consider the relationship between the structure of the commuting graph and $|G:Z(G)|$. We also build a family of groups whose commuting graphs have more than one connected component whose diameter is at…
Target class classification is a mixed classification and transition model whose integrated goal is to assign objects to a certain, so called target or normal class. The classification process is iterative, and in each step an object in a…
Let $f \colon X \to X$ be a continuous map on a compact metric space $X$ and let $\alpha_f$, $\omega_f$ and $ICT_f$ denote the set of $\alpha$-limit sets, $\omega$-limit sets and nonempty closed internally chain transitive sets…
We give a self-contained introduction to the theory of directed graphs, leading up to the relationship between the Perron-Frobenius eigenvectors of a graph and its autocatalytic sets. Then we discuss a particular dynamical system on a fixed…
Let $G$ be a graph. For a subset $X$ of $V(G)$, the switching $\sigma$ of $G$ is the signed graph $G^{\sigma}$ obtained from $G$ by reversing the signs of all edges between $X$ and $V(G)\setminus X$. Let $A(G^{\sigma})$ be the adjacency…
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is…
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure…
Graphs provide a natural way to represent data by encoding information about objects and the relationships between them. With the ever-increasing amount of data collected and generated, locating specific patterns of relationships between…
The dynamics by iteration of a function on a compact metric space, sometimes called a cascade, can be extended to the dynamics of a closed relation on such a space. Here we apply this relation dynamics to study semiflows (and their relation…