基于优先匹配的复杂网络有效目标控制
Efficient target control of complex networks based on preferential matching
摘要：
控制一个复杂的网络达到期望的状态在许多应用中是非常重要的。现有的工作提出了一种近似算法来找到驱动节点用于控制网络的部分节点。但该算法得到的驱动节点依赖于节点的匹配顺序，不能得到最优结果。在这里，我们提出了一种新的算法来找到驱动节点的目标控制的基础上优先匹配。该算法精心安排节点的匹配顺序，以最小化驱动节点集的规模。仿真和实际网络的实验结果表明，该算法的性能优于前一种算法。该算法在复杂网络控制中有着广泛的应用。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
