#jsDisabledContent { display:none; } My Account |  Register |  Help

# Network controllability

Article Id: WHEBN0033813121
Reproduction Date:

 Title: Network controllability Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Network controllability

Controlling a simple network.

Network Controllability is concerned about the structural controllability of a network. Controllability describes our ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs. This definition agrees well with our intuitive notion of control. The controllability of general directed and weighted complex networks has recently been the subject of intense study by a number of groups, worldwide.

## Contents

• Background 1
• Structural Controllability 1.1
• Maximum Matching 1.2
• References 3

## Background

Consider the canonical linear time-invariant dynamics on a complex network \dot{\mathbf{X}}(t) = \mathbf{A} \cdot \mathbf{X}(t) + \mathbf{B}\cdot \mathbf{u}(t) where the vector \mathbf{X}(t)=(x_1(t),\cdots,x_N(t))^\mathrm{T} captures the state of a system of N nodes at time t. The N \times N matrix \mathbf{A} describes the system's wiring digram and the interaction strength between the components. The N \times M matrix \mathbf{B} identifies the nodes controlled by an outside controller. The system is controlled through the time dependent input vector \mathbf{u}(t) = (u_1(t),\cdots,u_M(t))^\mathrm{T} that the controller imposes on the system. To identify the minimum number of driver nodes, denoted by N_\mathrm{D}, whose control is sufficient to fully control the system's dynamics, Liu et al.[1] attempted to combine the tools from structural control theory, graph theory and statistical physics. They showed[1] that the minimum number of inputs or driver nodes needed to maintain full control of the network is determined by the 'maximum matching’ in the network, that is, the maximum set of links that do not share start or end nodes. They tried[1] to develop an analytical framework, based on the in-out degree distribution, which predicts n_\mathrm{D} =N_\mathrm{D}/N for scale-free and Erdős–Rényi Graphs. It is however notable, that their formulation[1] would predict same values of {n_\mathrm{D}} for a chain graph and for a weak densely connected graph. Obviously, both these graphs have very different in and out degree distributions. A recent unpublished work,[2] questions whether degree, which is a purely local measure in networks, would completely describe controllability and whether even slightly distant nodes would have no role in deciding network controllability. Indeed, for many real-word networks, namely, food webs, neuronal and metabolic networks, the mismatch in values of {n_\mathrm{D}}^{real} and {n_\mathrm{D}}^\mathrm{rand\_degree} calculated by Liu et al.[1] is notable. It is obvious that if controllability is decided mainly by degree, why are {n_\mathrm{D}}^{real} and {n_\mathrm{D}}^\mathrm{rand\_degree} so different for many real world networks? They argued [1] (arXiv:1203.5161v1), that this might be due to the effect of degree correlations. However, it has been shown[2] that network controllability can be altered only by using betweenness centrality and closeness centrality, without using degree (graph theory) or degree correlations at all.

A schematic digram shows the control of a directed network. For a given directed network (Fig. a), one calculates its maximum matching: a largest set of edges without common heads or tails. The maximum matching will compose of a set of vertex-disjoint directed paths and directed cycles (see red edges in Fig.b). If a node is a head of a matching edge, then this node is matched (green nodes in Fig.b). Otherwise, it is unmatched (white nodes in Fig.b). Those unmatched nodes are the nodes one needs to control, i.e. the driver nodes. By injecting signals to those driver nodes, one gets a set of directed path with starting points being the inputs (see Fig.c). Those paths are called "stems". The resulting digraph is called U-rooted factorial connection. By "grafting" the directed cycles to those "stems", one gets "buds". The resulting digraph is called the cacti (see Fig.d). According to the structural controllability theorem,[3] since there is a cacti structure spanning the controlled network (see Fig.e), the system is controllable. The cacti structure (Fig.d) underlying the controlled network (Fig.e) is the "skeleton" for maintaining controllability.

### Structural Controllability

The concept of the structural properties was first introduced by Lin (1974)[3] and then extended by Shields and Pearson (1976)[4] and alternatively derived by Glover and Silverman (1976).[5] The main question is whether the lack of controllability or observability are generic with respect to the variable system parameters. In the framework of structural control the system parameters are either independent free variables or fixed zeros. This is consistent for models of physical systems since parameter values are never known exactly, with the exception of zero values which express the absence of interactions or connections.

### Maximum Matching

In graph theory, a matching is a set of edges without common vertices. Liu et al.[1] extended this definition to directed graph, where a matching is a set of directed edges that do not share start or end vertices. It is easy to check that a matching of a directed graph composes of a set of vertex-disjoint simple paths and cycles. The maximum matching of a directed network can be efficiently calculated by working in the bipartite representation using the classical Hopcroft–Karp algorithm, which runs in O(E√N) time in the worst case. For undirected graph, analytical solutions of the size and number of maximum matchings have been studied using the cavity method developed in statistical physics.[6] Liu et al.[1] extended the calculations for directed graph.

By calculating the maximum matchings of a wide range of real networks, Liu et al.[1] asserted that the number of driver nodes is determined mainly by the networks degree distribution P(k_\mathrm{in}, k_\mathrm{out}). They also calculated the average number of driver nodes for a network ensemble with arbitrary degree distribution using the cavity method. It is interesting that for a chain graph and a weak densely connected graph, both of which have very different in and out degree distributions; the formulation of Liu et al.[1] would predict same values of {n_\mathrm{D}}. Also, for many real-word networks, namely, food webs, neuronal and metabolic networks, the mismatch in values of {n_\mathrm{D}}^{real} and {n_\mathrm{D}}^\mathrm{rand\_degree} calculated by Liu et al.[1] is notable. If controllability is decided purely by degree, why are {n_\mathrm{D}}^{real} and {n_\mathrm{D}}^\mathrm{rand\_degree} so different for many real world networks? It remains open to scrutiny whether control robustness" in networks is influenced more by using betweenness centrality and closeness centrality[2] over degree (graph theory) based metrics.

While sparser graphs are more difficult to control,[1][2] it would obviously be interesting to find whether betweenness centrality and closeness centrality[2] or degree heterogeneity[1] plays a more important role in deciding controllability of sparse graphs with almost similar degree distributions.