arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.01277q-bio.MNq-bio.BM
收藏

不完全知识网络上转移率的推断

Inferring transition rates on networks with incomplete knowledge

Purushottam D. Dixit, Abhinav Jain, Gerhard Stock, Ken. A. Dill

摘要:

在许多领域中,一个感兴趣的问题是预测网络节点之间的转移率,给定有限的静态和动态信息。我们使用最大口径原则给出了一个解决方案。我们通过最大化网络上的随机步行者的路径熵来找到转移率矩阵,该网络被约束为再现一个静态分布和一些动态平均值。这里的一个主要发现是,当仅受平均跳跃率约束时,速率矩阵由速率$ω_{ab} \propto \sqrt{p_b/p_a}$对节点a和b处的稳态布居数$p_a$和$p_b$的平方根依赖性给出。我们举两个例子来说明我们的方法。首先,我们证明了这种方法正确地预测了两个基因的生化网络中的相关速率,其中我们知道先前模拟的确切结果。第二,我们表明,它正确地预测率肽构象转变,相比分子动力学模拟。这种方法可以用来推断大量的速率在已知的网络中,较小数量的稳态节点种群是已知的。

英文摘要:

Across many fields, a problem of interest is to predict the transition rates between nodes of a network, given limited stationary state and dynamical information. We give a solution using the principle of Maximum Caliber. We find the transition rate matrix by maximizing the path entropy of a random walker on the network constrained to reproducing a stationary distribution and a few dynamical averages. A main finding here is that when constrained only by the mean jump rate, the rate matrix is given by a square-root dependence of the rate, $ω_{ab} \propto \sqrt{p_b/p_a}$, on $p_a$ and $p_b$, the stationary state populations at nodes a and b. We give two examples of our approach. First, we show that this method correctly predicts the correlated rates in a biochemical network of two genes, where we know the exact results from prior simulation. Second, we show that it correctly predicts rates of peptide conformational transitions, when compared to molecular dynamics simulations. This method can be used to infer large numbers of rates on known networks where smaller numbers of steady-state node populations are known.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑