Variable-step-length algorithms for a random walk: hitting probability and computation performance
arXiv:1811.03788 · doi:10.1016/j.cpc.2019.04.001
Abstract
We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found that a finite step of the random walk produces a bias in the hitting probability and this bias vanishes in the limit of an infinitesimal step. Therefore, it is important to know how a change in the step size of the random walk influences the performance of simulations. We propose an algorithm with the most effective procedure for the step-length-change protocol.
8 pages, 2 figures
References in corpus (5)
- Unified Solution of the Expected Maximum of a Random Walk and the Discrete Flux to a Spherical Trap
- General flux to a trap in one and three dimensions
- How fast does a random walk cover a torus?
- Finite size effect of harmonic measure estimation in a DLA model: Variable size of probe particles
- Influence of the random walk finite step on the first-passage probability