arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.1838q-bio.QMq-bio.PE
收藏

随机生物系统的自适应多级模拟算法

An adaptive multi-level simulation algorithm for stochastic biological systems

Christopher Lester, Christian A. Yates, Michael B. Giles, Ruth E. Baker

摘要:

离散状态、连续时间马尔可夫模型广泛应用于生化反应网络的建模。他们的复杂性往往排除解析解,我们依靠随机模拟算法来估计系统统计。Gillespie算法是精确的,但计算成本很高,因为它模拟了每一个反应。因此,经常使用近似的随机模拟算法,如tau-leap算法。潜在的计算效率更高,除非τ相对较小,否则生成的系统统计数据会受到显著偏差的影响,在这种情况下,计算时间可以与Gillespie算法的计算时间相当。多水平方法(Anderson和Higham,多尺度模型。Simul 2012年,他解决了这个问题。一个基本的估计计算使用许多(廉价)样本路径在低精度。然后使用一些校正来减少该估计器中固有的偏差。使用成对样本路径的集合来估计每个校正项,其中每对样本路径中的一个路径与另一个路径相比以更高的精度生成(并且因此更昂贵)。通过在这些成对路径之间共享随机变量,可以减小每个校正估计量的方差。这使得多级方法非常有效,因为仅需要相对少量的成对路径来计算每个校正项。在原始的多级方法中,每个样本路径使用具有固定值$τ$的τ-跳跃算法来模拟。当系统的反应活性在感兴趣的时间尺度上显著变化时,这种方法可能导致性能差。通过引入一种新的,自适应的时间步进的方法,其中$τ$是根据每个样本路径的随机行为选择,我们扩展的多层次方法的适用性,这样的情况下。我们证明了我们的方法使用一些例子的效率。

英文摘要:

Discrete-state, continuous-time Markov models are widely used in the modeling of biochemical reaction networks. Their complexity often precludes analytic solution, and we rely on stochastic simulation algorithms to estimate system statistics. The Gillespie algorithm is exact, but computationally costly as it simulates every single reaction. As such, approximate stochastic simulation algorithms such as the tau-leap algorithm are often used. Potentially computationally more efficient, the system statistics generated suffer from significant bias unless tau is relatively small, in which case the computational time can be comparable to that of the Gillespie algorithm. The multi-level method (Anderson and Higham, Multiscale Model. Simul. 2012) tackles this problem. A base estimator is computed using many (cheap) sample paths at low accuracy. The bias inherent in this estimator is then reduced using a number of corrections. Each correction term is estimated using a collection of paired sample paths where one path of each pair is generated at a higher accuracy compared to the other (and so more expensive). By sharing random variables between these paired paths the variance of each correction estimator can be reduced. This renders the multi-level method very efficient as only a relatively small number of paired paths are required to calculate each correction term. In the original multi-level method, each sample path is simulated using the tau-leap algorithm with a fixed value of $τ$. This approach can result in poor performance when the reaction activity of a system changes substantially over the timescale of interest. By introducing a novel, adaptive time-stepping approach where $τ$ is chosen according to the stochastic behaviour of each sample path we extend the applicability of the multi-level method to such cases. We demonstrate the efficiency of our method using a number of examples.

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

↑