基于优先匹配的复杂网络结构可控性
Structure controllability of complex network based on preferential matching
摘要:
最小驱动节点集是研究复杂网络结构可控性的重要方法。最近的研究表明,MDS倾向于避免高度节点。然而,这种观察是基于对少量MDS的分析,因为枚举网络的所有MDS是一个#P问题。因此,过去的研究不足以得出令人信服的结论。在本文中,首先,我们提出了一个优先匹配算法来找到MDS具有特定的程度属性。然后,我们表明,通过优先匹配得到的MDS可以由高度和中度的节点。此外,实验结果还表明,一些网络的MDS的平均度往往大于整体网络的MDS,即使使用以前的研究方法获得的MDS。进一步的分析表明,驱动节点是否趋向于高度节点与网络的边方向密切相关。
英文摘要:
Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching can be composed of high- and medium-degree nodes. Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method. Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。