上图上的Laplacian动力学：通过并和并的可控性分析
Laplacian Dynamics on Cographs: Controllability Analysis through Joins and Unions
摘要：
本文研究了Laplacian动态网络在上图上的能控性。共图出现在各种网络的建模中，包括作为特殊实例的阈值图。在这项工作中，我们提出了充要条件的可控性的余图，并提供了一个有效的方法来选择一个最小的输入节点，从该网络是可控的。特别是，我们定义了一个兄弟分区的上图，并表明，网络是可控的，如果所有节点的任何细胞，除了一个分区被选为控制节点。此类特征的关键因素是上图的模块性与其模态性质之间的复杂联系。最后，我们利用这些结果来刻画某些子类的上图的可控性条件。
英文摘要：
In this paper, we examine the controllability of Laplacian dynamic networks on cographs. Cographs appear in modeling a wide range of networks and include as special instances, the threshold graphs. In this work, we present necessary and sufficient conditions for the controllability of cographs, and provide an efficient method for selecting a minimal set of input nodes from which the network is controllable. In particular, we define a sibling partition in a cograph and show that the network is controllable if all nodes of any cell of this partition except one are chosen as control nodes. The key ingredient for such characterizations is the intricate connection between the modularity of cographs and their modal properties. Finally, we use these results to characterize the controllability conditions for certain subclasses of cographs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
