Abstract

We propose a kinetic Monte Carlo method for the simulation of subdiffusive random walks on a cartesian lattice. The random walkers are subject to viscoelastic forces which we compute from their individual trajectories via the fractional Langevin equation. At every step the walkers move by one lattice unit, which makes them differ essentially from continuous time random walks, where the subdiffusive behavior is induced by random waiting. To enable computationally inexpensive simulations with n-step memories, we use an approximation of the memory and the memory kernel functions with a complexity O(log n). Eventual discretization and approximation artifacts are compensated with numerical adjustments of the memory kernel functions. We verify with a number of analyses that this new method provides binary fractional random walks that are fully consistent with the theory of fractional brownian motion.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call