{"title":"延迟更新提高了随机模拟的速度","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":"{\"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}","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}
Lazy Updating increases the speed of stochastic simulations
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.