Related papers: Strong Structural Controllability of Signed Networ…
A signed graph is a graph whose edges are labelled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles.…
This paper introduces and solves a structural controllability problem for ensembles of switched linear systems. All individual systems in the ensemble are sparse and governed by the same sparsity pattern, and undergo switching among…
It is well-known that the controllability of finite-dimensional nonlinear systems can be established by showing the controllability of the linearized system. However, this classical result does not generalize to infinite-dimensional…
The minimum number of inputs needed to control a network is frequently used to quantify its controllability. Control of linear dynamics through a minimum set of inputs, however, often has prohibitively large energy requirements and there is…
We examine the conditions under which a signed graph contains an edge or a vertex that is contained in a unique negative circle or a unique positive circle. For an edge in a unique signed circle, the positive and negative case require the…
We study the problem of controlling a general complex network towards an assigned synchronous evolution, by means of a pinning control strategy. We define the pinning-controllability of the network in terms of the spectral properties of an…
In this paper, we study the concept of approximate controllability of retarded network systems of neutral type. On one hand, we reformulate such systems as free-delay boundary control systems on product spaces. On the other hand, we use the…
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae…
This paper studies the problem of controlling complex networks, that is, the joint problem of selecting a set of control nodes and of designing a control input to steer a network to a target state. For this problem (i) we propose a metric…
Let $G$ be a simple, undirected graph on the vertex set $V=\{1,2,\ldots ,n\}$ and let $A$ be the adjacency matrix of $G.$ A non-empty subset $ \{i_{1},i_{2},\ldots ,i_{k}\}$ of $V$ is called a driver set for $G$ if the system…
In this paper, we develop a notion of controllability for hypergraphs via tensor algebra and polynomial control theory. Inspired by uniform hypergraphs, we propose a new tensor-based multilinear dynamical system representation, and derive a…
Network control refers to a very large and diverse set of problems including controllability of linear time-invariant dynamical systems, where the objective is to select an appropriate input to steer the network to a desired state. There…
We study the controllability of a coupled system of linear parabolic equations, with non-negativity constraint on the state. We establish two results of controllability to trajectories in large time: one for diagonal diffusion matrices with…
In this paper, we demonstrate a conflicting relationship between two crucial properties---controllability and robustness---in linear dynamical networks of diffusively coupled agents. In particular, for any given number of nodes $N$ and…
In this two-part paper, we identify a broad class of decentralized output-feedback LQG systems for which the optimal control strategies have a simple intuitive estimation structure and can be computed efficiently. Roughly, we consider the…
Signed networks are graphs whose edges are labelled with either a positive or a negative sign, and can be used to capture nuances in interactions that are missed by their unsigned counterparts. The concept of balance in signed graph theory…
In this paper, we study the well-posedness and approximate controllability of a class of network systems having delays and controls at the boundary conditions. The particularity of this work is that the network system is defined on infinite…
The human brain displays rich communication dynamics that are thought to be particularly well-reflected in its marked community structure. Yet, the precise relationship between community structure in structural brain networks and the…
We analyze in detail the subtle yet critical differences between the structural controllability and observability of the triplet $(A,B,C)$ in the two cases that this is viewed as a linear dynamical network of interconnected nodes or as a a…
This paper investigates observability/controllability of a networked dynamic system (NDS) in which system matrices of its subsystems are expressed through linear fractional transformations (LFT). Some relations have been obtained between…