从内在噪声中重建网络
Network Reconstruction from Intrinsic Noise
AI总结:
本文研究了从观测变量中推断未知动态系统网络的问题,针对线性时不变系统,分析了在最小阶情况下问题的可解条件,并提出了一种代数Riccati方程用于解决非最小相位情况下的等效网络构造。
摘要:
本文考虑了推断由未知内在噪声输入驱动的未知动态系统网络的问题。等价地,我们试图仅从这些变量的观测中识别显式变量之间的直接因果依赖关系。对于线性、时不变、最小阶系统,我们characterise在什么条件下该问题是良好设定的。我们首先证明,如果从输入到显式状态的传递矩阵是最小相位,则无论网络拓扑如何,该问题都有唯一解。这等价于输出谱密度只有一个有效的谱因子(除了输入符号的选择)。如果放松相位最小性假设,我们证明该问题由一个单个的代数Riccati方程(ARE)所刻画,其维度由潜在状态的数量决定。该ARE的解数是网络解数的上界。我们给出了任何两个动态网络具有相同输出谱密度的必要和充分条件,可用于构造所有等效网络。广泛模拟量化了不同问题规模下的解数。对于一个稍简单的情况,我们还提供了一种从输出谱密度构造所有等效网络的算法。
英文摘要:
This paper considers the problem of inferring an unknown network of dynamical systems driven by unknown, intrinsic, noise inputs. Equivalently we seek to identify direct causal dependencies among manifest variables only from observations of these variables. For linear, time-invariant systems of minimal order, we characterise under what conditions this problem is well posed. We first show that if the transfer matrix from the inputs to manifest states is minimum phase, this problem has a unique solution irrespective of the network topology. This is equivalent to there being only one valid spectral factor (up to a choice of signs of the inputs) of the output spectral density. If the assumption of phase-minimality is relaxed, we show that the problem is characterised by a single Algebraic Riccati Equation (ARE), of dimension determined by the number of latent states. The number of solutions to this ARE is an upper bound on the number of solutions for the network. We give necessary and sufficient conditions for any two dynamical networks to have equal output spectral density, which can be used to construct all equivalent networks. Extensive simulations quantify the number of solutions for a range of problem sizes. For a slightly simpler case, we also provide an algorithm to construct all equivalent networks from the output spectral density.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。