论文标题
通过主动激发推断网络动力系统的拓扑
Inferring Topology of Networked Dynamical Systems by Active Excitations
论文作者
论文摘要
近年来,网络动力学系统(NDSS)的拓扑推断受到了相当大的关注。大多数开创性的作品都涉及从大量观察到NDS的拓扑,以便从渐近上近似实际的拓扑。本文利用NDSS对各种干扰的特征以及干扰的影响将始终如一地传播,本文着重于通过一些主动激发来推断拓扑。关键挑战是区分系统噪声和激发的不同影响与展示状态偏差,在这种情况下,影响会随着时间而衰落,探测不能任意大。为了练习,我们提出了一种基于单发激励的推理方法来推断节点的$ h $ -HOP邻居。首先得出了准确的单跳邻居推理的激发条件,并保证了概率。然后,我们将结果扩展到$ h $ -HOP邻居的推理和多个激发案例,从而提供了推理精度和激发幅度之间的明确关系。具体而言,基于激发的推理方法不仅适用于无法获得丰富观测值的场景,而且还可以用作提高现有方法准确性的辅助手段。进行模拟以验证分析结果。
Topology inference for networked dynamical systems (NDSs) has received considerable attention in recent years. The majority of pioneering works have dealt with inferring the topology from abundant observations of NDSs, so as to approximate the real one asymptotically. Leveraging the characteristic that NDSs will react to various disturbances and the disturbance's influence will consistently spread, this paper focuses on inferring the topology by a few active excitations. The key challenge is to distinguish different influences of system noises and excitations from the exhibited state deviations, where the influences will decay with time and the exciatation cannot be arbitrarily large. To practice, we propose a one-shot excitation based inference method to infer $h$-hop neighbors of a node. The excitation conditions for accurate one-hop neighbor inference are first derived with probability guarantees. Then, we extend the results to $h$-hop neighbor inference and multiple excitations cases, providing the explicit relationships between the inference accuracy and excitation magnitude. Specifically, the excitation based inference method is not only suitable for scenarios where abundant observations are unavailable, but also can be leveraged as auxiliary means to improve the accuracy of existing methods. Simulations are conducted to verify the analytical results.