arXiv Analytics

Sign in

arXiv:0710.3269 [math.PR]AbstractReferencesReviewsResources

Differential equation approximations for Markov chains

R. W. R. Darling, J. R. Norris

Published 2007-10-17, updated 2008-04-23Version 2

We formulate some simple conditions under which a Markov chain may be approximated by the solution to a differential equation, with quantifiable error probabilities. The role of a choice of coordinate functions for the Markov chain is emphasised. The general theory is illustrated in three examples: the classical stochastic epidemic, a population process model with fast and slow variables, and core-finding algorithms for large random hypergraphs.

Comments: Published in at http://dx.doi.org/10.1214/07-PS121 the Probability Surveys (http://www.i-journals.org/ps/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Journal: Probability Surveys 2008, Vol. 5, 37-79
Categories: math.PR
Subjects: 05C65, 60J75, 05C80
Related articles: Most relevant | Search more
arXiv:math/0503460 [math.PR] (Published 2005-03-22)
Structure of large random hypergraphs
arXiv:math/0109020 [math.PR] (Published 2001-09-04, updated 2004-01-16)
Structure of large random hypergraphs
arXiv:math/0702007 [math.PR] (Published 2007-02-01, updated 2008-11-17)
Finite size scaling for the core of large random hypergraphs