论文标题
基于修剪基序异形的有限状态中有针对性网络的可控性分析
Controllability analysis of directed networks in finite states based on pruning motif isomorph
论文作者
论文摘要
当前的驱动程序节点搜索方法难以应付大型网络，并且解决方案过程不考虑节点成本。为了解决有限状态中具有不同节点成本的网络的实际控制问题，本文提出了用于驱动程序节点集的修剪和基序异构搜索方法。首先，我们证明了在部分节点控制下严格控制网络的足够条件，然后我们对节点进行了分类并证明了修剪网络的等效性可控性，然后我们建立了三种模型的最大增强路径搜索，本地修剪和主题的模型，以形成一个完整的驱动程序搜索搜索algorithM。最后，该算法通过真实网络验证。结果表明，我们的方法不仅保证了搜索结果的准确性，而且还具有较低的时间复杂性，可以有效地处理大型网络，并且最大驱动程序节点的不超过16.84％可以控制整个网络。
The current driver nodes search methods are difficult to cope with large networks, and the solution process does not consider the node cost. In order to solve the practical control problem of networks with different node costs in finite states, this paper proposes a pruning and motif isomorph search method for driver node set. Firstly, we prove the sufficient conditions for the network to be strictly controllable under partial nodes control, then we classify the nodes and prove the equivalence controllability of the pruning network, and then we establish three models of maximum augmenting path search, local pruning and motif matching to form a complete driver nodes set search algorithm. Finally, the algorithm is validated by real networks. The results show that our method not only guarantee the accuracy of search results, but also has the low time complexity, which can efficiently handle large networks, and no more than 16.84% of the maximum driver nodes can control the whole network.
