Lazy Updating increases the speed of stochastic simulations

K. Ehlert, L. Loewe
{"title":"Lazy Updating increases the speed of stochastic simulations","authors":"K. Ehlert, L. Loewe","doi":"10.14288/1.0043675","DOIUrl":null,"url":null,"abstract":"Biological reaction networks often contain what might be called 'hub molecules', which are involved in many reactions. For example, ATP is commonly consumed and produced. When reaction networks contain molecules like ATP, they are difficult to efficiently simulate, because every time such a molecule is consumed or produced, the propensities of numerous reactions need to be updated. In order to increase the speed of simulations, we developed 'Lazy Updating', which postpones some propensity updates until some aspect of the state of the system changes by more than a defined threshold. Lazy Updating works with several existing stochastic simulation algorithms, including Gillespie's direct method and the Next Reaction Method. We tested Lazy Updating on two example models, and for the larger model it increased the speed of simulations over eight-fold while maintaining a high level of accuracy. These increases in speed will be larger for models with more widely connected hub molecules. Thus Lazy Updating can contribute towards making models with a limited computing time budget more realistic by including previously neglected hub molecules.","PeriodicalId":119149,"journal":{"name":"arXiv: Quantitative Methods","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Quantitative Methods","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14288/1.0043675","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Biological reaction networks often contain what might be called 'hub molecules', which are involved in many reactions. For example, ATP is commonly consumed and produced. When reaction networks contain molecules like ATP, they are difficult to efficiently simulate, because every time such a molecule is consumed or produced, the propensities of numerous reactions need to be updated. In order to increase the speed of simulations, we developed 'Lazy Updating', which postpones some propensity updates until some aspect of the state of the system changes by more than a defined threshold. Lazy Updating works with several existing stochastic simulation algorithms, including Gillespie's direct method and the Next Reaction Method. We tested Lazy Updating on two example models, and for the larger model it increased the speed of simulations over eight-fold while maintaining a high level of accuracy. These increases in speed will be larger for models with more widely connected hub molecules. Thus Lazy Updating can contribute towards making models with a limited computing time budget more realistic by including previously neglected hub molecules.
延迟更新提高了随机模拟的速度
生物反应网络通常包含所谓的“中心分子”,它参与了许多反应。例如,ATP通常被消耗和产生。当反应网络包含像ATP这样的分子时,很难有效地模拟它们,因为每次这样的分子被消耗或产生时,需要更新许多反应的倾向。为了提高模拟的速度,我们开发了“延迟更新”,它推迟一些倾向更新,直到系统状态的某些方面的变化超过定义的阈值。惰性更新适用于几种现有的随机模拟算法,包括Gillespie的直接法和下一次反应法。我们在两个示例模型上测试了Lazy Updating,对于较大的模型,它将模拟速度提高了8倍以上,同时保持了高水平的准确性。对于具有更广泛连接的轮毂分子的模型,这些速度的增加将更大。因此,延迟更新可以通过包含以前忽略的轮毂分子,使具有有限计算时间预算的模型更加现实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信