Related papers: Simple dynamics on graphs
We consider the general model for dynamical systems defined on a simplicial complex. We describe the conjugacy classes of these systems and show how symmetries in a given simplicial complex manifest in the dynamics defined thereon,…
A recent article by Weidner et al. [2021] presents a method to extract graph properties that are predictive of the dynamical behavior of multivariate, discrete models of biochemical regulation. In other words, a method that uses only…
Hypergraphs have emerged as a powerful modeling framework to represent systems with multiway interactions, that is systems where interactions may involve an arbitrary number of agents. Here we explore the properties of real-world…
Network decontamination is a well-known problem, in which the aim of the mobile agents should be to decontaminate the network (i.e., both nodes and edges). This problem comes with an added constraint, i.e., of \emph{monotonicity}, in which…
Dynamical systems---by which we mean machines that take time-varying input, change their state, and produce output---can be wired together to form more complex systems. Previous work has shown how to allow collections of machines to…
We consider a discrete dynamical system on a compact manifold M generated by a homeomorphism f. Let C = {M(i)} be a finite covering of M by closed cells. The symbolic image of a dynamical system is a directed graph G with vertices…
A dynamic concordia discors, a finely tuned equilibrium between opposing forces, is hypothesized to drive historical transformations. Similarly, a precise interplay of excitation and inhibition, often approximated by an 80:20 ratio,…
In this paper we study the dynamics of a general non-autonomous dynamical system generated by a family of continuous self maps on a compact space $X$. We derive necessary and sufficient conditions for the system to exhibit complex dynamical…
In this paper we prove a recent conjecture by M. Hirsch, which says that if $(f,\Omega)$ is a discrete time monotone dynamical system, with $f\colon \Omega\to\Omega$ a homeomorphism on an open connected subset of a finite dimensional vector…
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph $G$, a temporal graph is represented by assigning a set of integer time-labels to every edge $e$ of $G$, indicating the…
We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on $[\mathbb{N}]^{<\mathbb{N}}$ with finite (or,…
A technique is introduced which allows to generate -- starting from any solvable discrete-time dynamical system involving N time-dependent variables -- new, generally nonlinear, generations of discrete-time dynamical systems, also involving…
Let $H$ be a graph possibly with loops and $G$ be a multigraph without loops. An $H$-coloring of $G$ is a function $c: E(G) \rightarrow V(H)$. We will say that $G$ is an $H$-colored multigraph, whenever we are taking a fixed $H$-coloring of…
The asymptotic behaviour of deterministic logit dynamics in heterogeneous routing games is analyzed. It is proved that in directed multigraphs with parallel routes, and in series composition of such multigraphs, the dynamics admits a…
We consider the population dynamics of a set of species whose network of catalytic interactions is described by a directed graph. The relationship between the attractors of this dynamics and the underlying graph theoretic structures like…
This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…
A dynamical systems approach to competition of Saffman-Taylor fingers in a channel is developed. This is based on the global study of the phase space structure of the low-dimensional ODE's defined by the classes of exact solutions of the…
In this paper, we study the dynamics induced by finite commutative relation. We prove that the dynamics generated by such a non-trivial collection cannot be transitive/super-transitive and hence cannot exhibit higher degrees of mixing. As a…
Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…