This paper deals with strong structural controllability of linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. Instead of assuming that the nonzero and arbitrary entries of the system matrices can take their values completely independently, this paper allows equality constraints on these entries, in the sense that a priori given entries in the system matrices are restricted to take arbitrary but identical values. To formalize this general class of structured systems, we introduce the concepts of colored pattern matrices and colored structured systems. The main contribution of this paper is that it generalizes both the classical results on strong structural controllability of structured systems as well as recent results on controllability of systems defined on colored graphs. In this paper, we will establish both algebraic and graph-theoretic conditions for strong structural controllability of this more general class of structured systems.

No abstract

We consider a multi-population, represented by a network of groups of individuals. Every player of each group can choose between two options, and we study the problem of reaching consensus. The dynamics not only depend on the dynamics within the group, but they also depend on the topology of the network, so neighboring groups influence individuals as well. First, we develop a mathematical model of this networked bio-inspired evolutionary behavior and we study its steadystate. We look at the special case where the underlying network topology is a regular and unweighted graph and show that the steady-state is a consensus equilibrium. A sufficient condition for exponential stability is given. Finally, a related networked dynamical system with connections to the Bass model is studied and we conclude the paper with simulations.

No abstract

No abstract