arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.09141math.OCmath.DS
收藏

动态网络可识别的充要拓扑条件

Necessary and Sufficient Topological Conditions for Identifiability of Dynamical Networks

Henk J. van Waarde, Pietro Tesi, M. Kanat Camlibel

摘要:

本文讨论了节点信号之间的关系用适当的传递函数来描述,而外部信号对每个节点信号都有影响的动态网络。我们感兴趣的图论条件,这种动态网络的可识别性,我们假设只有一个子集的节点进行测量,但网络的基本图形结构是已知的。这个问题最近已经从一般的观点进行了研究。粗略地说,通用可识别性意味着网络中的传递函数可以为与图相关联的“几乎所有”网络矩阵识别。在本文中,我们研究了更强的概念,所有的网络矩阵的可识别性。为此,我们引入了一个新的图论概念,称为图形简化过程。在此基础上,给出了可识别性的充要拓扑条件。值得注意的是,我们还表明,这些条件可以通过多项式时间算法验证。最后,我们解释了我们的结果如何推广现有的充分条件的可识别性。

英文摘要:

This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. We are interested in graph-theoretic conditions for identifiability of such dynamical networks, where we assume that only a subset of nodes is measured but the underlying graph structure of the network is known. This problem has recently been investigated from a generic viewpoint. Roughly speaking, generic identifiability means that the transfer functions in the network can be identified for "almost all" network matrices associated with the graph. In this paper, we investigate the stronger notion of identifiability for all network matrices. To this end, we introduce a new graph-theoretic concept called the graph simplification process. Based on this process, we provide necessary and sufficient topological conditions for identifiability. Notably, we also show that these conditions can be verified by polynomial time algorithms. Finally, we explain how our results generalize existing sufficient conditions for identifiability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑