Analyzing controllability of neural networks

In recent years, due to the relation between cognitive control and mathematical concept of control dynamical systems, there has been growing interest in the descriptive analysis of complex networks with linear dynamics, permeating many aspects from everyday life, obtaining considerable advances in the description of their structural and dynamical properties. Nevertheless, much less effort has been devoted to studying the controllability of the dynamics taking place on them. Concretely, for complex systems is of interest to study the exact controllability, this measure is defined as the minimum set of controls that are needed to steer the whole system toward any desired state. In this paper, a revision of controllability concepts is presented and provides conditions for exact controllability for the multiagent systemsPostprint (author's final draft

Control Engineering

Control means a speci?c action to reach the desired behavior of a system. In the control of industrial processes generally technological processes, are considered, but control is highly required to keep any physical, chemical, biological, communication, economic, or social process functioning in a desired manner

Time Complexity of Decentralized Fixed-Mode Verification

Given an interconnected system, this note is concerned with the time complexity of verifying whether an unrepeated mode of the system is a decentralized fixed mode (DFM). It is shown that checking the decentralized fixedness of any distinct mode is tantamount to testing the strong connectivity of a digraph formed based on the system. It is subsequently proved that the time complexity of this decision problem using the proposed approach is the same as the complexity of matrix multiplication. This work concludes that the identification of distinct DFMs (by means of a deterministic algorithm, rather than a randomized one) is computationally very easy, although the existing algorithms for solving this problem would wrongly imply that it is cumbersome. This note provides not only a complexity analysis, but also an efficient algorithm for tackling the underlying problem