Related papers: Attractor separation and signed cycles in asynchro…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. We are interested in graph-theoretic conditions…
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…
A cycle $C$ of a graph $G$ is \emph{isolating} if every component of $G-V(C)$ is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle $C$ of length $6 \leq |E(C)| < \left…
The climate is a complex non-equilibrium dynamical system that relaxes toward a steady state under the continuous input of solar radiation and dissipative mechanisms. The steady state is not necessarily unique. A useful tool to describe the…
Lov\'asz has completely characterised the structure of graphs with no two vertex-disjoint cycles, while Slilaty has given a structural characterisation of graphs with no two vertex-disjoint odd cycles; his result is in fact more general,…
We consider dynamical systems given by interval maps with a finite number of turning points (including critical points, discontinuities) possibly of different critical orders from two sides. If such a map $f$ is continuous and piecewise…
Directed acyclic graph models with hidden variables have been much studied, particularly in view of their computational efficiency and connection with causal methods. In this paper we provide the circumstances under which it is possible for…
There is a wealth of applied problems that can be posed as a dynamical system defined on a network with both attractive and repulsive interactions. Some examples include: understanding synchronization properties of nonlinear oscillator;,…
A replicator equation with mutation processes is numerically studied. Without any mutations, two characteristics of the replicator dynamics are known: an exponential divergence of the dominance period, and hierarchical orderings of the…
We introduce a numerical method to study random Boolean networks with asynchronous stochas- tic update. Each node in the network of states starts with equal occupation probability and this probability distribution then evolves to a steady…
Exceptional point in non-Hermitian system possesses fascinating properties. We present an exactly solvable attractor dynamics for the first time from a two-level time dependent non-Hermitian Hamiltonian. It allows a way to evolve to the…
For systems with hidden attractors and unstable equilibria, the property that hidden attractors are not connected with unstable equilibria is now accepted as one of their main characteristics. To the best of our knowledge this property has…
The existence of non-continuous invariant graphs (or strange non-chaotic attractors) in quasiperiodically forced systems has generated great interest, but there are still very few rigorous results about the properties of these objects. In…
Dynamic networks are structured interconnections of dynamical systems (modules) driven by external excitation and disturbance signals. In order to identify their dynamical properties and/or their topology consistently from measured data, we…
We study how the dynamics of a class of discrete dynamical system models for neuronal networks depends on the connectivity of the network. Specifically, we assume that the network is an Erd\H{o}s-R\'{enyi} random graph and analytically…
An important dynamical property of biological interaction networks is persistence, which intuitively means that "no species goes extinct". It has been conjectured that dynamical system models of weakly reversible networks (i.e., networks…
In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…
Attractors of dynamical systems may be networks in phase space that can be heteroclinic (where there are dynamical connections between simple invariant sets) or excitable (where a perturbation threshold needs to be crossed to a dynamical…
We give a constructive method for realizing an arbitrary directed graph (with no one-cycles) as a heteroclinic or an excitable dynamic network in the phase space of a system of coupled cells of two types. In each case, the system is…
In the first part of this paper, we showed that three coupled populations of identical phase oscillators give rise to heteroclinic cycles between invariant sets where populations show distinct frequencies. Here, we now give explicit…