多时间尺度随机化学反应网络的灵敏度分析
Sensitivity analysis for stochastic chemical reaction networks with multiple time-scales
摘要:
化学反应网络的随机模型是近年来研究的热点。对于这样的模型,参数灵敏度的估计是一个重要的和具有挑战性的问题。敏感度值有助于分析网络,了解其鲁棒性,并确定给定结果的关键反应。大多数的方法,存在于文献中的参数敏感性的估计,依赖于Monte Carlo模拟使用Gillespie的随机模拟算法或其变种。众所周知,当网络包含在不同时间尺度激发的反应时,这种模拟方法可能非常昂贵,这是许多重要的生物化学网络的特征。对于这样的网络,通常可以利用时间尺度分离,并通过模拟“简化”模型来近似捕获原始动态,该模型通过以某种方式消除快速反应而获得。本文的目的是将这些模型降阶技术与灵敏度分析结合起来。我们证明了在一定条件下,降阶模型的灵敏度值可以近似地恢复原模型的灵敏度值。通过一个例子,我们说明了我们的结果可以帮助大幅减少计算成本的多时间尺度的反应网络的参数灵敏度估计。为了证明我们的结果,我们使用耦合参数的基础上的随机时变表示的库尔茨。我们还利用了马尔可夫链和多维波动方程的占据时间分布之间的某些联系。
英文摘要:
Stochastic models for chemical reaction networks have become very popular in recent years. For such models, the estimation of parameter sensitivities is an important and challenging problem. Sensitivity values help in analyzing the network, understanding its robustness properties and also in identifying the key reactions for a given outcome. Most of the methods that exist in the literature for the estimation of parameter sensitivities, rely on Monte Carlo simulations using Gillespie's stochastic simulation algorithm or its variants. It is well-known that such simulation methods can be prohibitively expensive when the network contains reactions firing at different time-scales, which is a feature of many important biochemical networks. For such networks, it is often possible to exploit the time-scale separation and approximately capture the original dynamics by simulating a "reduced" model, which is obtained by eliminating the fast reactions in a certain way. The aim of this paper is to tie these model reduction techniques with sensitivity analysis. We prove that under some conditions, the sensitivity values of the reduced model can be used to approximately recover the sensitivity values for the original model. Through an example we illustrate how our result can help in sharply reducing the computational costs for the estimation of parameter sensitivities for reaction networks with multiple time-scales. To prove our result, we use coupling arguments based on the random time change representation of Kurtz. We also exploit certain connections between the distributions of the occupation times of Markov chains and multi-dimensional wave equations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。