2008
DOI: 10.1063/1.2819665
|View full text |Cite
|
Sign up to set email alerts
|

Incorporating postleap checks in tau-leaping

Abstract: By explicitly representing the reaction times of discrete chemical systems as the firing times of independent, unit rate Poisson processes we develop a new adaptive tau-leaping procedure. The procedure developed is novel in that accuracy is guaranteed by performing post-leap checks. Because the representation we use separates the randomness of the model from the state of the system, we are able to perform the post-leap checks in such a way that the statistics of the sample paths generated will not be skewed by… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
106
0
2

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 101 publications
(108 citation statements)
references
References 18 publications
(18 reference statements)
0
106
0
2
Order By: Relevance
“…To further study the new strategy, we adopt a Poisson process formulation of the SSA proposed by Anderson. 34 Let k j (t) denote the total number of firings for reaction R j from initial time 0 to t. Then,…”
Section: Analysis Of the Partitioning Strategymentioning
confidence: 99%
“…To further study the new strategy, we adopt a Poisson process formulation of the SSA proposed by Anderson. 34 Let k j (t) denote the total number of firings for reaction R j from initial time 0 to t. Then,…”
Section: Analysis Of the Partitioning Strategymentioning
confidence: 99%
“…As a result, much effort has been invested in the speed-up of exact or approximate SSAs, 18,[23][24][25][26][27][28][29][30][31][32][33][34][35][36] producing different algorithms that require different tradeoffs. 18,[24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39][40] Tau-Leaping has emerged as an important approximate SSA. 21,24,37,[41][42][43] Below we present an algorithm that trades a very small amount of accuracy for a substantial reduction in computing time by skipping some updates in a special category of parts, which we call "hubs."…”
Section: Introductionmentioning
confidence: 99%
“…18,[24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39][40] Tau-Leaping has emerged as an important approximate SSA. 21,24,37,[41][42][43] Below we present an algorithm that trades a very small amount of accuracy for a substantial reduction in computing time by skipping some updates in a special category of parts, which we call "hubs." The usefulness of such an approximation depends on the biological importance of hubs.…”
Section: Introductionmentioning
confidence: 99%
“…Various refinements of the tau-leaping method have been proposed in the literature. [17][18][19][20][21][22][23][24] Another approach for gaining computational efficiency is to consider hybrid methods. [25][26][27][28][29][30] However, in many applications the cell cannot be assumed to be well-stirred and the spatial distribution of some molecular species may be important for studying key cellular processes.…”
Section: Introductionmentioning
confidence: 99%
“…Simply discarding the rejected time-step will skew the statistics of the solution. To guarantee that the sample paths' statistics are unbiased we employ the conditioning technique developed by Anderson 20 for the tau-leaping method when steps are rejected.…”
Section: Introductionmentioning
confidence: 99%