Fast approximate simulation of finite long-range spin systems
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2019
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914183109410816 |
|---|---|
| author | McVinish, Ross Hodgkinson, Liam |
| author_facet | McVinish, Ross Hodgkinson, Liam |
| contents | Tau leaping is a popular method for performing fast approximate simulation of certain continuous time Markov chain models typically found in chemistry and biochemistry. This method is known to perform well when the transition rates satisfy some form of scaling behaviour. In a similar spirit to tau leaping, we propose a new method for approximate simulation of spin systems which approximates the evolution of spin at each site between sampling epochs as an independent two-state Markov chain. When combined with fast summation methods, our method offers considerable improvement in speed over the standard Doob-Gillespie algorithm. We provide a detailed analysis of the error incurred for both the number of sites incorrectly labelled and for linear functions of the state. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1910_03725 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Fast approximate simulation of finite long-range spin systems McVinish, Ross Hodgkinson, Liam Probability 60H35 Tau leaping is a popular method for performing fast approximate simulation of certain continuous time Markov chain models typically found in chemistry and biochemistry. This method is known to perform well when the transition rates satisfy some form of scaling behaviour. In a similar spirit to tau leaping, we propose a new method for approximate simulation of spin systems which approximates the evolution of spin at each site between sampling epochs as an independent two-state Markov chain. When combined with fast summation methods, our method offers considerable improvement in speed over the standard Doob-Gillespie algorithm. We provide a detailed analysis of the error incurred for both the number of sites incorrectly labelled and for linear functions of the state. |
| title | Fast approximate simulation of finite long-range spin systems |
| topic | Probability 60H35 |
| url | https://arxiv.org/abs/1910.03725 |