Fast approximate simulation of finite long-range spin systems

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 l...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors McVinish, Ross, Hodgkinson, Liam
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 09.10.2019
Subjects
Algorithms
Computer simulation
Error analysis
Linear functions
Markov analysis
Markov chains
Organic chemistry
Simulation
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422