1,014 research outputs found
Strong Structural Controllability of Signed Networks
In this paper, we discuss the controllability of a family of linear
time-invariant (LTI) networks defined on a signed graph. In this direction, we
introduce the notion of positive and negative signed zero forcing sets for the
controllability analysis of positive and negative eigenvalues of system
matrices with the same sign pattern. A sufficient combinatorial condition that
ensures the strong structural controllability of signed networks is then
proposed. Moreover, an upper bound on the maximum multiplicity of positive and
negative eigenvalues associated with a signed graph is provided
Zero forcing sets and controllability of dynamical systems defined on graphs
In this paper, controllability of systems defined on graphs is discussed. We
consider the problem of controllability of the network for a family of matrices
carrying the structure of an underlying directed graph. A one-to-one
correspondence between the set of leaders rendering the network controllable
and zero forcing sets is established. To illustrate the proposed results,
special cases including path, cycle, and complete graphs are discussed.
Moreover, as shown for graphs with a tree structure, the proposed results of
the present paper together with the existing results on the zero forcing sets
lead to a minimal leader selection scheme in particular cases
Zero forcing number, constrained matchings and strong structural controllability
The zero forcing number is a graph invariant introduced to study the minimum
rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero
forcing number of a simple undirected graph. We complete this NP-hardness
result by showing that the non-equivalent problem of computing the zero forcing
number of a directed graph allowing loops is also NP-hard. The rest of the
paper is devoted to the strong controllability of a networked system. This kind
of controllability takes into account only the structure of the interconnection
graph, but not the interconnection strengths along the edges. We provide a
necessary and sufficient condition in terms of zero forcing sets for the strong
controllability of a system whose underlying graph is a directed graph allowing
loops. Moreover, we explain how our result differs from a recent related result
discovered by Monshizadeh et al. Finally, we show how to solve the problem of
finding efficiently a minimum-size input set for the strong controllability of
a self-damped system with a tree-structure.Comment: Submitted as a journal paper in May 201
Strong Structural Controllability of Systems on Colored Graphs
This paper deals with structural controllability of leader-follower networks.
The system matrix defining the network dynamics is a pattern matrix in which a
priori given entries are equal to zero, while the remaining entries take
nonzero values. The network is called strongly structurally controllable if for
all choices of real values for the nonzero entries in the pattern matrix, the
system is controllable in the classical sense. In this paper we introduce a
more general notion of strong structural controllability which deals with the
situation that given nonzero entries in the system's pattern matrix are
constrained to take identical nonzero values. The constraint of identical
nonzero entries can be caused by symmetry considerations or physical
constraints on the network. The aim of this paper is to establish graph
theoretic conditions for this more general property of strong structural
controllability.Comment: 13 page
Controllability of protein-protein interaction phosphorylation-based networks: Participation of the hub 14-3-3 protein family
Posttranslational regulation of protein function is an ubiquitous mechanism in eukaryotic cells. Here, we analyzed biological properties of nodes and edges of a human protein-protein interaction phosphorylation-based network, especially of those nodes critical for the network controllability. We found that the minimal number of critical nodes needed to control the whole network is 29%, which is considerably lower compared to other real networks. These critical nodes are more regulated by posttranslational modifications and contain more binding domains to these modifications than other kinds of nodes in the network, suggesting an intra-group fast regulation. Also, when we analyzed the edges characteristics that connect critical and non-critical nodes, we found that the former are enriched in domain-to-eukaryotic linear motif interactions, whereas the later are enriched in domain-domain interactions. Our findings suggest a possible structure for protein-protein interaction networks with a densely interconnected and self-regulated central core, composed of critical nodes with a high participation in the controllability of the full network, and less regulated peripheral nodes. Our study offers a deeper understanding of complex network control and bridges the controllability theorems for complex networks and biological protein-protein interaction phosphorylation-based networked systems.Fil: Uhart, Marina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza. Instituto de Histología y Embriología de Mendoza Dr. Mario H. Burgos. Universidad Nacional de Cuyo. Facultad de Cienicas Médicas. Instituto de Histología y Embriología de Mendoza Dr. Mario H. Burgos; ArgentinaFil: Flores, Gabriel. Eventioz/eventbrite Company; ArgentinaFil: Bustos, Diego Martin. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Mendoza. Instituto de Histología y Embriología de Mendoza Dr. Mario H. Burgos. Universidad Nacional de Cuyo. Facultad de Cienicas Médicas. Instituto de Histología y Embriología de Mendoza Dr. Mario H. Burgos; Argentin
A Unifying Framework for Strong Structural Controllability
This paper deals with strong structural controllability of linear systems. In
contrast to existing work, the structured systems studied in this paper have a
so-called zero/nonzero/arbitrary structure, which means that some of the
entries are equal to zero, some of the entries are arbitrary but nonzero, and
the remaining entries are arbitrary (zero or nonzero). We formalize this in
terms of pattern matrices whose entries are either fixed zero, arbitrary
nonzero, or arbitrary. We establish necessary and sufficient algebraic
conditions for strong structural controllability in terms of full rank tests of
certain pattern matrices. We also give a necessary and sufficient graph
theoretic condition for the full rank property of a given pattern matrix. This
graph theoretic condition makes use of a new color change rule that is
introduced in this paper. Based on these two results, we then establish a
necessary and sufficient graph theoretic condition for strong structural
controllability. Moreover, we relate our results to those that exists in the
literature, and explain how our results generalize previous work.Comment: 11 pages, 6 Figure
- …