Dynamical networks: continuous time and general discrete time models (Q618189)

To model a general dynamical network, the authors consider a finite graph \(G\), defined by a square connectivity matrix (having entries \(0\) or \(1\)), and endowed with Lipschitzian maps (for each \(i\in G\)): \[ f_i: \mathbb{R}^n\to \mathbb{R}^n,\quad F_i: (\mathbb{R}^n)^G\to \mathbb{R}^n. \] The global evolution of \(x= (x_i)_{i\in G}\in (\mathbb{R}^n)^G\) is then modelled by the ordinary differential equations: \[ \dot x_i= f_i(x_i)+ F_i(x)\qquad(\forall i\in G). \] The asymptotic behaviour of such a system is governed by the topological pressure of the associated symbolic dynamics (along admissible paths in \(G^{\mathbb{N}}\)), whose negativity entails the existence of a globally attracting fixed point. The authors compute this topological pressure, as the log of the spectral radius of some matrix, in some cases, getting thus a sufficient condition for global stability.