Related papers: Simple dynamics on graphs

Chaotic attractors, chaotic saddles and periodic orbits are examples of chain-recurrent sets. Using arbitrary small controls, a trajectory starting from any point in a chain-recurrent set can be steered to any other in that set. The…

Networks are a widely used and efficient paradigm to model real-world systems where basic units interact pairwise. Many body interactions are often at play, and cannot be modelled by resorting to binary exchanges. In this work, we consider…

We consider linear dynamical systems with a structure of a multigraph. The vertices are associated to linear spaces and the edges correspond to linear maps between those spaces. We analyse the asymptotic growth of trajectories (associated…

Let $\Gamma$ be a finite simple graph. If for some integer $n\geqslant 4$, $\Gamma$ is a $K_n$-free graph whose complement has an odd cycle of length at least $2n-5$, then we say that $\Gamma$ is an $n$-exact graph. For a finite group $G$,…

Let $G$ be a graph on $n$ vertices. A vertex of $G$ with degree at least $n/2$ is called a heavy vertex, and a cycle of $G$ which contains all the heavy vertices of $G$ is called a heavy cycle. In this paper, we characterize the graphs…

This work describes the way that topological mixing and chaos in continua, as induced by discrete dynamical systems, can or can't be understood through topological conjugacy with symbolic dynamical systems. For example, there is no symbolic…

We analyse the stability of large, linear dynamical systems of variables that interact through a fully connected random matrix and have inhomogeneous growth rates. We show that in the absence of correlations between the coupling strengths,…

We consider global dynamics of reaction systems as introduced by Ehrenfeucht and Rozenberg. The dynamics is represented by a directed graph, the so-called transition graph, and two reaction systems are considered equivalent if their…

We derive conditions for the identifiability of nonlinear networks characterized by additive dynamics at the level of the edges when all the nodes are excited. In contrast to linear systems, we show that the measurement of all sinks is…

We study deterministic and quantum dynamics from a constructive "finite" point of view, since the introduction of a continuum, or other actual infinities in physics poses serious conceptual and technical difficulties, without any need for…

Revealing physical interactions in complex systems from observed collective dynamics constitutes a fundamental inverse problem in science. Current reconstruction methods require access to a system's model or dynamical data at a level of…

This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…

We investigate dynamics of large scale and slow deformations of layered structures. Starting from the respective model equations for a non-conserved system, a conserved system and a binary fluid, we derive the interface equations which are…

This paper introduces indefinite proximities inherent in the collection of physical objects found in a dynamical system. Axiomatically, these indefinite proximities lead to a new form of Hausdorff topology, which is indefinite…

Let claw be the graph $K_{1,3}$. A graph $G$ on $n\geq 3$ vertices is called \emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$, and 1-heavy if at least one end-vertex of each induced claw of…

Let $\hom(G)$ denote the size of the largest clique or independent set of a graph $G$. In 2007, Bukh and Sudakov proved that every $n$-vertex graph $G$ with $\hom(G) = O(\log n)$ contains an induced subgraph with $\Omega(n^{1/2})$ distinct…

In the study of dynamical systems on networks/graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that…

Many networks describing complex systems are directed: the interactions between elements are not symmetric. Recent work has shown that these networks can display properties such as trophic coherence or non-normality, which in turn affect…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

In this paper we consider dynamical systems generated by a diffeomorphism F defined on U an open subset of R^n, and give conditions over F which imply that their dynamics can be understood by studying the flow of an associated differential…