A Unifying Framework for Strong Structural Controllability

This article deals with strong structural controllability of linear systems. In contrast to the existing work, the structured systems studied in this article 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 article. 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 exist in the literature and explain how our results generalize previous work.</p

Buffered Qualitative Stability explains the robustness and evolvability of transcriptional networks

The gene regulatory network (GRN) is the central decision‐making module of the cell. We have developed a theory called Buffered Qualitative Stability (BQS) based on the hypothesis that GRNs are organised so that they remain robust in the face of unpredictable environmental and evolutionary changes. BQS makes strong and diverse predictions about the network features that allow stable responses under arbitrary perturbations, including the random addition of new connections. We show that the GRNs of E. coli, M. tuberculosis, P. aeruginosa, yeast, mouse, and human all verify the predictions of BQS. BQS explains many of the small- and large‐scale properties of GRNs, provides conditions for evolvable robustness, and highlights general features of transcriptional response. BQS is severely compromised in a human cancer cell line, suggesting that loss of BQS might underlie the phenotypic plasticity of cancer cells, and highlighting a possible sequence of GRN alterations concomitant with cancer initiation. DOI: http://dx.doi.org/10.7554/eLife.02863.00

Network polarization, filter bubbles, and echo chambers: An annotated review of measures and reduction methods

Polarization arises when the underlying network connecting the members of a community or society becomes characterized by highly connected groups with weak inter-group connectivity. The increasing polarization, the strengthening of echo chambers, and the isolation caused by information filters in social networks are increasingly attracting the attention of researchers from different areas of knowledge such as computer science, economics, social and political sciences. This work presents an annotated review of network polarization measures and models used to handle the polarization. Several approaches for measuring polarization in graphs and networks were identified, including those based on homophily, modularity, random walks, and balance theory. The strategies used for reducing polarization include methods that propose edge or node editions (including insertions or deletions, as well as edge weight modifications), changes in social network design, or changes in the recommendation systems embedded in these networks.Comment: Corrected a typo in Section 3.2; the rest remains unchange

Analysis of Structural Properties of Complex and Networked Systems

Over the past decades, science and society have been experiencing systems that tend to be increasingly sophisticated and interconnected. Although it would be challenging to understand and control complex systems fully, the analysis and control of such systems can be partially realized only after applying some reasonable simplifications. In particular, for the analysis of certain control properties, such as controllability, a complex system can be simplified to a linear structured system capturing an essential part of the structural information in that system, such as the existence or absence of relations between components of the system. This thesis has studied the effect of the interconnection structure of complex systems on their control properties following a structural analysis approach. More explicitly, we have analyzed strong structural properties of complex systems. The main contributions have been split into two parts:1. We have introduced a new framework for linear structured systems in which the relations between the components of the systems are allowed to be unknown. This kind of systems has been formalized in terms of pattern matrices whose entries are either fixed zero, arbitrary nonzero, or arbitrary. We have dealt with strong structural controllability and the solvability of the FDI problem of this kind of linear structured systems.2. We have introduced a novel framework for linear structured systems in which a priori given entries in the system matrices are restricted to take arbitrary but identical values. Several sufficient algebraic and graph theoretic conditions were established under which these systems are strongly structurally controllable.Finally, in the outlook subsection, we have suggested some future research problems concerning the analysis of strong structural properties of complex systems

From data and structure to models and controllers

Systems and control theory deals with analyzing dynamical systems and shaping their behavior by means of control. Dynamical systems are widespread, and control theory therefore has numerous applications ranging from the control of aircraft and spacecraft to chemical process control. During the last decades, a series of remarkable new control techniques have been developed. The majority of these techniques rely on mathematical models of the to-be-controlled system. However, the growing complexity of modern engineering systems complicates mathematical modeling. In this thesis, we therefore propose new methods to analyze and control dynamical systems without relying on a given system model. Models are thereby replaced by two other ingredients, namely measured data and system structure. In the first part of the thesis, we consider the problem of data-driven control. This problem involves the development of controllers for a dynamical system, purely on the basis of data. We consider both stabilizing controllers, and controllers that minimize a given cost function. Secondly, we focus on networked systems. A networked system is a collection of interconnected dynamical subsystems. For this type of systems, our aim is to reconstruct the interactions between subsystems on the basis of data. Finally, we consider the problem of assessing controllability of a dynamical system using its structure. We provide conditions under which this is possible for a general class of structured systems

Biological Networks

Networks of coordinated interactions among biological entities govern a myriad of biological functions that span a wide range of both length and time scales—from ecosystems to individual cells and from years to milliseconds. For these networks, the concept “the whole is greater than the sum of its parts” applies as a norm rather than an exception. Meanwhile, continued advances in molecular biology and high-throughput technology have enabled a broad and systematic interrogation of whole-cell networks, allowing the investigation of biological processes and functions at unprecedented breadth and resolution—even down to the single-cell level. The explosion of biological data, especially molecular-level intracellular data, necessitates new paradigms for unraveling the complexity of biological networks and for understanding how biological functions emerge from such networks. These paradigms introduce new challenges related to the analysis of networks in which quantitative approaches such as machine learning and mathematical modeling play an indispensable role. The Special Issue on “Biological Networks” showcases advances in the development and application of in silico network modeling and analysis of biological systems

Multi-agent persistent monitoring of a finite set of targets

The general problem of multi-agent persistent monitoring finds applications in a variety of domains ranging from meter to kilometer-scale systems, such as surveillance or environmental monitoring, down to nano-scale systems such as tracking biological macromolecules for studying basic biology and disease. The problem can be cast as moving the agents between targets, acquiring information from or in some fashion controlling the states of the targets. Under this formulation, at least two questions need to be addressed. The first is the design of motion trajectories for the agents as they move among the spatially distributed targets and jointly optimize a given cost function that describes some desired application. The second is the design of the controller that an agent will use at a target to steer the target's state as desired. The first question can be viewed in at least two ways: first, as an optimal control problem with the domain of the targets described as a continuous space, and second as a discrete scheduling task. In this work we focus on the second approach, which formulates the target dynamics as a hybrid automaton, and the geometry of the targets as a graph. We show how to find solutions by translating the scheduling problem into a search for the optimal route. With a route specifying the visiting sequence in place, we derive the optimal time the agent spends at each target analytically. The second question, namely that of steering the target's state, can be formulated from the perspective of the target, rather than the agent. The mobile nature of the agents leads to intermittencontrol, such that the controller is assumed to be disconnected when no agent is at the target. The design of the visiting schedule of agents to one target can affect the reachability (controllability) of this target's control system and the design of any specific controller. Existing test techniques for reachability are combined with the idea of lifting to provide conditions on systems such that reachability is maintained in the presence of periodic disconnections from the controller. While considering an intermittently connected control with constraints on the control authority and in the presence of a disturbance, the concept of 'degree of controllability' is introduced. The degree is measured by a region of states that can be brought back to the origin in a given finite time. The size of this region is estimated to evaluate the performance of a given sequence

GRASP News Volume 9, Number 1

A report of the General Robotics and Active Sensory Perception (GRASP) Laboratory