随机生化反应网络Tau跳跃模拟的Array-RQMC方差缩减
Variance Reduction with Array-RQMC for Tau-Leaping Simulation of Stochastic Biological and Chemical Reaction Networks
摘要:
我们探索使用Array-RQMC,一种随机拟蒙特卡罗方法,设计用于模拟马尔可夫链,以减少方差时,模拟随机生物或化学反应网络与$τ$ -跳跃。该任务是通过$n$样本路径上的样本平均值来估计给定未来时间$T$的分子拷贝数函数的期望值,并且目标是减小该样本平均估计值的方差。我们发现,当该方法是适当的应用,方差减少的因素,在数千个可以得到。这些因素比以前观察到的其他作者谁尝试RQMC方法相同的例子。Array-RQMC模拟了一系列马尔可夫链的实现,并需要一个排序函数在每一步之后根据它们的状态对这些链进行重新排序。排序函数的选择是该方法效率的关键因素,尽管在我们的实验中,Array-RQMC从来没有比普通的蒙特卡罗差,无论排序方法如何。每步每种类型的反应的预期数量也对效率增益有影响。
英文摘要:
We explore the use of Array-RQMC, a randomized quasi-Monte Carlo method designed for the simulation of Markov chains, to reduce the variance when simulating stochastic biological or chemical reaction networks with $τ$-leaping. The task is to estimate the expectation of a function of molecule copy numbers at a given future time $T$ by the sample average over $n$ sample paths, and the goal is to reduce the variance of this sample-average estimator. We find that when the method is properly applied, variance reductions by factors in the thousands can be obtained. These factors are much larger than those observed previously by other authors who tried RQMC methods for the same examples. Array-RQMC simulates an array of realizations of the Markov chain and requires a sorting function to reorder these chains according to their states, after each step. The choice of sorting function is a key ingredient for the efficiency of the method, although in our experiments, Array-RQMC was never worse than ordinary Monte Carlo, regardless of the sorting method. The expected number of reactions of each type per step also has an impact on the efficiency gain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。