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
Physical-state supervision for design-only Gaussian process surrogates of implosion simulations
Chang Liu, Hao Shen, Chuanying Li
Energy-dependent trapping of backscattered helium during magnetron sputtering growth: A molecular dynamics study
Pascal Brault, Anne-Lise Thomann, Alejandro Borroto
Alter-excitons in Altermagnets: Symmetry, Splitting and Dispersion
Yuanfan Xiong, Liangyu Wang, Xuan Wu et al.
All-electron RT-TDDFT with Exact Exchange based on Numeric Atom-centered Orbitals for Condensed Matter
Jianhang Xu, Christopher Shepard, Yosuke Kanai
Polyconvex neural-network surrogates with learned paired directional features for anisotropic hyperelastic homogenization
S. Ares de Parga, A. Cornejo, J. A. Hernández et al.
Parallel Design of a GPU-Resident Semi-Lagrangian Drift-Kinetic Solver on Unstructured Extruded Tokamak Meshes
Mark F. Adams