arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1109.3556math.OCcs.SYeess.SY
收藏

关于路径图和圈图的可达性与可观测性

On the reachability and observability of path and cycle graphs

University of Lecce(莱切大学)

Gianfranco Parlangeli, Giuseppe Notarstefano

AI总结:

本文研究基于拉普拉斯平均共识算法的网络系统在通信图为路径或圈时的可达性与可观测性,利用数论简单代数规则给出充要条件,并推导出路径图单节点可达当且仅当节点数为2的幂,圈图任意两节点可达当且仅当节点数为素数。

摘要:

本文研究了当通信图为路径或圈时,运行基于拉普拉斯平均共识算法的网络系统的可达性和可观测性。更详细地说,我们基于数论中的简单代数规则,提供了必要且充分的条件,以刻画所有且仅有的使网络系统可达(分别地,可观测)的节点。我们的结果的有趣直接推论是:(i)路径图从任意单个节点可达(可观测)当且仅当图的节点数是2的幂,$n=2^i, i\in atural$,以及(ii)圈图从任意一对节点可达(可观测)当且仅当$n$是素数。对于任意一组控制(观测)节点,我们给出了(不可达)不可观测特征值和(不可达)不可观测子系统特征向量的闭式表达式。

英文摘要:

In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: (i) a path graph is reachable (observable) from any single node if and only if the number of nodes of the graph is a power of two, $n=2^i, i\in \natural$, and (ii) a cycle is reachable (observable) from any pair of nodes if and only if $n$ is a prime number. For any set of control (observation) nodes, we provide a closed form expression for the (unreachable) unobservable eigenvalues and for the eigenvectors of the (unreachable) unobservable subsystem.

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

↑