Ding J, Wen C, Li G, Tu P, Ji D, Zou Y, Huang J. Target Controllability in Multilayer Networks via Minimum-Cost Maximum-Flow Method.
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2021;
32:1949-1962. [PMID:
32530810 DOI:
10.1109/tnnls.2020.2995596]
[Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
In this article, to maximize the dimension of controllable subspace, we consider target controllability problem with maximum covered nodes set in multiplex networks. We call such an issue as maximum-cost target controllability problem. Likewise, minimum-cost target controllability problem is also introduced which is to find minimum covered node set and driver node set. To address these two issues, we first transform them into a minimum-cost maximum-flow problem based on graph theory. Then an algorithm named target minimum-cost maximum-flow (TMM) is proposed. It is shown that the proposed TMM ensures the target nodes in multiplex networks to be controlled with the minimum number of inputs as well as the maximum (minimum) number of covered nodes. Simulation results on Erdős-Rényi (ER-ER) networks, scale-free (SF-SF) networks, and real-life networks illustrate satisfactory performance of the TMM.
Collapse