A first step to implement Gillespie’s algorithm with rejection sampling

<Para ID="Par1">It is well known that firings of a well-stirred chemically reacting system can be described by a continuous-time Markov chain. The currently-used exact implementations of Gillespie’s algorithm simulate every reaction event individually and thus the computational cost is inevitably high. In this paper, we present an exact implementation of a continuous-time Markov chain with bounded intensity which can simulate the process at given time points. The implementation involves rejection sampling, with a trajectory either accepted or rejected based on just a few reaction events. A simulation study on the Schlögl model is presented and supplementary materials for this article are available online. Copyright Springer-Verlag Berlin Heidelberg 2015