网络系统的拓扑推断:因果性观点与非渐近性能
Topology Inference for Network Systems: Causality Perspective and Non-asymptotic Performance
摘要:
网络系统的拓扑推理在许多领域中起着至关重要的作用。本文提出了一种基于空度的方法,该方法基于NS单轨迹的噪声观测,该轨迹由具有一般有向拓扑的状态空间模型表示。具体来说,我们首先证明了它的密切关系,多个轨迹的理想格兰杰估计和传统的普通最小二乘(OLS)估计为一个单一的轨迹。沿着这条线,我们分析了所提出的方法的非渐近推理性能的OLS估计作为参考,包括渐近和边际稳定的系统。推导的收敛速度和精度结果表明,该方法具有更好的性能,在解决潜在的相关观测,并实现零推理误差渐近。此外,我们的方法的在线/递归版本建立有效的计算或时变的情况下。扩展NS与非线性动力学也进行了讨论。综合测试结果证实了理论研究结果,并与其他算法的比较突出了所提出的方法的优越性。
英文摘要:
Topology inference for network systems (NSs) plays a crucial role in many areas. This paper advocates a causality-based method based on noisy observations from a single trajectory of a NS, which is represented by the state-space model with general directed topology. Specifically, we first prove its close relationships with the ideal Granger estimator for multiple trajectories and the traditional ordinary least squares (OLS) estimator for a single trajectory. Along with this line, we analyze the non-asymptotic inference performance of the proposed method by taking the OLS estimator as a reference, covering both asymptotically and marginally stable systems. The derived convergence rates and accuracy results suggest the proposed method has better performance in addressing potentially correlated observations and achieves zero inference error asymptotically. Besides, an online/recursive version of our method is established for efficient computation or time-varying cases. Extensions on NSs with nonlinear dynamics are also discussed. Comprehensive tests corroborate the theoretical findings and comparisons with other algorithms highlight the superiority of the proposed method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。