A Fast Algorithm for High-Dimensional Markov Processes with Finite Sets of Transition Rates
Abstract
The discrete class algorithm presented in this paper is an efficient simulation tool for stochastic processes governed by a reasonably small set of transition rates. The algorithm is presented, its performance compared to prevailing methods and applications to epitaxial growth and neuronal models are sketched. Source code is available from the author's WWW-site.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.