在大型网络上推断Langevin动力学中的隐藏状态:平均情况性能
Inferring hidden states in Langevin dynamics on large networks: Average case performance
摘要:
我们提出了在大型网络中动态推理问题的平均性能结果,其中一组节点被隐藏,而其他节点的时间轨迹被观察到。这种情况的例子可以发生在信号转导和基因调控网络中。我们专注于通过一般对称的随机高斯耦合的连续变量相互作用的线性随机动力学。我们分析了推理误差,给出了隐藏路径的后验分布的方差,在热力学极限和系统参数的函数和隐藏节点和观察节点的数量之间的比率α。通过应用卡尔曼滤波器递归,我们发现后验动态是由一个“有效”的漂移,结合了观测的效果。我们提出了两种方法来表征后验方差,使我们能够解决,分别是平衡和非平衡动态。第一个呼吁随机矩阵理论,揭示了平均谱特性的推理误差和典型的后松弛时间,第二个是基于动力泛函和产生的推理误差作为一个代数方程的解决方案。
英文摘要:
We present average performance results for dynamical inference problems in large networks, where a set of nodes is hidden while the time trajectories of the others are observed. Examples of this scenario can occur in signal transduction and gene regulation networks. We focus on the linear stochastic dynamics of continuous variables interacting via random Gaussian couplings of generic symmetry. We analyze the inference error, given by the variance of the posterior distribution over hidden paths, in the thermodynamic limit and as a function of the system parameters and the ratio α between the number of hidden and observed nodes. By applying Kalman filter recursions we find that the posterior dynamics is governed by an "effective" drift that incorporates the effect of the observations. We present two approaches for characterizing the posterior variance that allow us to tackle, respectively, equilibrium and nonequilibrium dynamics. The first appeals to Random Matrix Theory and reveals average spectral properties of the inference error and typical posterior relaxation times, the second is based on dynamical functionals and yields the inference error as the solution of an algebraic equation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。