Target Controllability of Two-Layer Multiplex Networks Based on Network Flow Theory.

In this paper, we consider the target controllability of two-layer multiplex networks, which is an outstanding challenge faced in various real-world applications. We focus on a fundamental issue regarding how to allocate a minimum number of control sources to guarantee the controllability of each given target subset in each layer, where the external control sources are limited to interact with only one layer. It is shown that this issue is essentially a path cover problem, which is to locate a set of directed paths denoted as P and cycles denoted as C to cover the target sets under the constraint that the nodes in the second layer cannot be the starting node of any element in P , and the number of elements in P attains its minimum. In addition, the formulated path cover problem can be further converted into a maximum network flow problem, which can be efficiently solved by an algorithm called maximum flow-based target path-cover (MFTP). We rigorously prove that MFTP provides the minimum number of control sources for guaranteeing the target controllability of two-layer multiplex networks. It is anticipated that this paper would serve wide applications in target control of real-life networks.