Related papers: Comment on "Controllability of Complex Networks wi…
A dynamical system is controllable if by imposing appropriate external signals on a subset of its nodes, it can be driven from any initial state to any desired state in finite time. Here we study the impact of various network…
This paper presents the foundation for a decomposition theory for Boolean networks, a type of discrete dynamical system that has found a wide range of applications in the life sciences, engineering, and physics. Given a Boolean network…
This paper studies the controllability backbone problem in dynamical networks defined over graphs. The main idea of the controllability backbone is to identify a small subset of edges in a given network such that any subnetwork containing…
Dynamic networks consist of interconnected dynamical systems. The subsystems can be viewed as transformations of input signals into output signals, where signals flow from one system into another through interconnections. The signal flows…
This paper deals with the controllability of linear one-dimensional hyperbolic systems. Reformulating the problem in terms of linear difference equations and making use of infinite-dimensional realization theory, we obtain both necessary…
This paper studies controllability properties of recurrent neural networks. The new contributions are: (1) an extension of the result in the previous paper "Complete controllability of continuous-time recurrent neural networks" (Sontag and…
To achieve control objectives for extremely large-scale complex networks using standard methods is essentially intractable. In this work a theory of the approximate control of complex network systems is proposed and developed by the use of…
We study the problem of computing a minimal subset of nodes of a given asynchronous Boolean network that need to be controlled to drive its dynamics from an initial steady state (or attractor) to a target steady state. Due to the phenomenon…
The current driver nodes search methods are difficult to cope with large networks, and the solution process does not consider the node cost. In order to solve the practical control problem of networks with different node costs in finite…
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…
Real-world network systems are inherently dynamic, with network topologies undergoing continuous changes over time. Previous works often focus on static networks or rely on complete prior knowledge of evolving topologies, whereas real-world…
Complex networks are graphs representing real-life systems that exhibit unique characteristics not found in purely regular or completely random graphs. The study of such systems is vital but challenging due to the complexity of the…
Control theory concerns with the question if and how it is possible to drive the behavior of a complex dynamical system. A system is said to be controllable if we can drive it from any initial state to any desired final state in finite…
This paper (parts I and II) provides an expository introduction to monotone and near-monotone dynamical systems associated to biochemical networks, those whose graphs are consistent or near-consistent. Many conclusions can be drawn from…
In this paper, we propose a novelty-based metric for quantitative characterization of the controllability of complex networks. This inherently bounded metric describes the average angular separation of an input with respect to the past…
The response of complex networks to perturbations is of utmost importance in areas as diverse as ecosystem management, emergency response, and cell reprogramming. A fundamental property of networks is that the perturbation of one node can…
We consider the relation of symmetries and subspace controllability for spin networks with XXZ coupling subject to control of a single node by a local potential (Z-control). Such networks decompose into excitation subspaces. Focusing on the…
The paradigm of layered networks is used to describe many real-world systems -- from biological networks, to social organizations and transportation systems. Recently there has been much progress in understanding the general properties of…
According to the exact controllability theory, the controllability is investigated analytically for two typical types of self-similar bipartite networks, i.e., the classic deterministic scale-free networks and Cayley trees. Due to their…
Controllability of complex networks arises in many technological problems involving social, financial, road, communication, and smart grid networks. In many practical situations, the underlying topology might change randomly with time, due…