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.
翻译:近些年来,网络动态系统(NDS)的地形推断受到相当重视,大多数开拓性工程是从大量国家数据系统观测中推断出地形学,以便大致接近真实的图象。利用国家数据系统将应对各种扰动和扰动影响的特点,本文件的重点是通过一些积极的推理推断出地形学。关键的挑战在于区分系统噪音和引力的不同影响与所显示的状态偏差,在这些偏差中,影响会随着时间的流逝而衰减,而且排泄不能任意大。为了实践,我们建议一种基于推论的一次性引力方法,以推算节点的近邻。准确的一呼声推力条件首先以概率推导出。然后,我们将结果推广到美元邻居推力推力和多次推力案例,提供推力准确度和推力大小之间的明确关系。具体地说,基于推力推力的推力推力方法基于推导力推导出一个速法,用以推导出一个节点的邻接邻接邻接的近点,其精确性推导力首先可以推断为概率。然后进行模拟推算,而只能进行推算。