Target Control of Directed Networks based on Network Flow Problems
This provides a rigorous, efficient solution for target control in arbitrary directed networks, which is a fundamental challenge for applications in network science and complex systems.
The paper solves the problem of finding the minimum number of control sources to control a target subset in directed networks, including those with loops, by converting it into a maximum network flow problem. The proposed MFTP method achieves O(|V|^{1/2}|E|) complexity and is proven optimal.
Target control of directed networks, which aims to control only a target subset instead of the entire set of nodes in large natural and technological networks, is an outstanding challenge faced in various real world applications. We address one fundamental issue regarding this challenge, i.e., for a given target subset, how to allocate a minimum number of control sources which provide input signals to the network nodes. This issue remains open in general networks with loops. We show that the issue is essentially a path cover problem and can be further converted into a maximum network flow problem. A method termed `Maximum Flow based Target Path-cover' (MFTP) with complexity $O(|V|^{1/2}|E|)$ in which $|V|$ and $|E|$ denote the number of network nodes and edges is proposed. It is also rigorously proven to provide the minimum number of control sources on arbitrary directed networks, whether loops exist or not. We anticipate that this work would serve wide applications in target control of real-life networks, as well as counter control of various complex systems which may contribute to enhancing system robustness and resilience.