寻找控制复杂网络的所有可能输入节点的有效算法
An efficient algorithm for finding all possible input nodes for controlling complex networks
摘要:
理解复杂网络的结构可控性需要确定网络的最小输入节点集(MIS)。有人建议,找到一个MIS相当于计算网络的最大匹配,其中不匹配的节点构成MIS。然而,网络的最大匹配通常不是唯一的,并且找到所有的MIS可以提供对网络的可控性的深刻见解。寻找所有可能的输入节点,形成所有MIS的并集,对于大型网络来说是计算上的挑战。在这里,我们提出了一个有效的枚举算法的问题。其主要思想是修改最大匹配算法,使其有效地找到所有可能的输入节点,只需计算一个MIS。我们严格证明了新算法的正确性,并评估其性能的合成和大型真实网络。实验结果表明,新算法在大型真实网络上的运行速度比现有方法快几个数量级。
英文摘要:
Understanding structural controllability of a complex network requires to identify a Minimum Input nodes Set (MIS) of the network. It has been suggested that finding an MIS is equivalent to computing a maximum matching of the network, where the unmatched nodes constitute an MIS. However, maximum matching of a network is often not unique, and finding all MISs may provide deep insights to the controllability of the network. Finding all possible input nodes, which form the union of all MISs, is computationally challenging for large networks. Here we present an efficient enumerative algorithm for the problem. The main idea is to modify a maximum matching algorithm to make it efficient for finding all possible input nodes by computing only one MIS. We rigorously proved the correctness of the new algorithm and evaluated its performance on synthetic and large real networks. The experimental results showed that the new algorithm ran several orders of magnitude faster than the existing method on large real networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。