Efficient target control of complex networks based on preferential matching

TL;DR

This paper introduces a novel preferential matching algorithm for target control in complex networks, improving the selection of driver nodes to achieve desired states more efficiently than previous methods.

Contribution

The paper proposes a new algorithm that optimally arranges node matching order to minimize driver nodes for target control in complex networks.

Findings

The proposed algorithm outperforms existing methods in synthetic networks.

The algorithm demonstrates improved efficiency on real-world network data.

Results show reduced driver node set size for effective control.

Abstract

Controlling a complex network towards a desire state is of great importance in many applications. Existing works present an approximate algorithm to find the driver nodes used to control partial nodes of the network. However, the driver nodes obtained by this algorithm depend on the matching order of nodes and cannot get the optimum results. Here we present a novel algorithm to find the driver nodes for target control based on preferential matching. The algorithm elaborately arrange the matching order of nodes in order to minimize the size of the driver nodes set. The results on both synthetic and real networks indicate that the performance of proposed algorithm are better than the previous one. The algorithm may have various application in controlling complex networks.