A Fast Algorithm for High-Dimensional Markov Processes with Finite Sets of Transition Rates
Hans E. Plesser, Dietmar Wendt
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.
Create a lesson
Related papers
Automatic generation of exchange-correlation response kernels
Susi Lehtola
A unified gas-kinetic wave-particle method for multiscale gas-mixture flow with an elementary chemical reaction
Cao Junzhe, Wei Yufeng, Long Wenpei et al.
Energy Yield and Lifetime Climate Classification via Machine Learning for Optimizing Photovoltaic Module Design and Materials
Youri Blom, Sofia Dutto, Alexandru Costache et al.
Rapidly Convergent Finite-Element Domain Decomposition Method With Two-Channel Transmission Conditions
Furkan Şık, Fernando L. Teixeira, Balasubramaniam Shanker
A sharp-diffuse interface model for intermittent and isolated topological transitions
Raaghav Ramani
Macroparticles with different weights relax to different temperatures in Particle-In-Cell simulations
Remi Lehe, Arianna Formenti, Justin R. Angus et al.