Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2509.12631 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915496099577856 |
|---|---|
| author | Solan, Ron Getz, Gad |
| author_facet | Solan, Ron Getz, Gad |
| contents | The Gillespie algorithm and its extensions are commonly used for the simulation of chemical reaction networks. A limitation of these algorithms is that they have to process and update the system after every reaction, requiring significant computation. Another class of algorithms, based on the tau-leaping method, is able to simulate multiple reactions at a time at the cost of decreased accuracy. We present a new algorithm for the exact simulation of chemical reaction networks that is capable of sampling multiple reactions at a time via a first-order approximation similarly to the tau-leaping methods. We prove that the algorithm has an improved runtime complexity compared to existing methods for the exact simulation of chemical reaction networks, and present an efficient and easy to use implementation that outperforms existing methods in practice. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_12631 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An exact tau-leaping method Solan, Ron Getz, Gad Molecular Networks Probability The Gillespie algorithm and its extensions are commonly used for the simulation of chemical reaction networks. A limitation of these algorithms is that they have to process and update the system after every reaction, requiring significant computation. Another class of algorithms, based on the tau-leaping method, is able to simulate multiple reactions at a time at the cost of decreased accuracy. We present a new algorithm for the exact simulation of chemical reaction networks that is capable of sampling multiple reactions at a time via a first-order approximation similarly to the tau-leaping methods. We prove that the algorithm has an improved runtime complexity compared to existing methods for the exact simulation of chemical reaction networks, and present an efficient and easy to use implementation that outperforms existing methods in practice. |
| title | An exact tau-leaping method |
| topic | Molecular Networks Probability |
| url | https://arxiv.org/abs/2509.12631 |