SearcharxivSearch

arXiv · 0909.4790

Error analysis of tau-leap simulation methods

Abstract

We perform an error analysis for numerical approximation methods of continuous time Markov chain models commonly found in the chemistry and biochemistry literature. The motivation for the analysis is to be able to compare the accuracy of different approximation methods and, specifically, Euler tau-leaping and midpoint tau-leaping. We perform our analysis under a scaling in which the size of the time discretization is inversely proportional to some (bounded) power of the norm of the state of the system. We argue that this is a more appropriate scaling than that found in previous error analyses in which the size of the time discretization goes to zero independent of the rest of the model. Under the present scaling, we show that midpoint tau-leaping achieves a higher order of accuracy, in both a weak and a strong sense, than Euler tau-leaping; a result that is in contrast to previous analyses. We present examples that demonstrate our findings.

Explore related subjects

Keep this discovery

BibTeXRIS

David F. Anderson, Arnab Ganguly, Thomas G. Kurtz. 2009-09-25. Error analysis of tau-leap simulation methods. https://doi.org/10.1214/10-aap756

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR