# Global random walk algorithm for diffusion processes

## Abstract

The Global Random Walk algorithm (GRW) performs the simultaneous tracking on a fixed grid of large collections of particles, while the computational costs remain comparable to those of a single-trajectory simulation by the traditional Particle Tracking (PT) approach.

Unlike the sequential PT procedure, GRW simulates diffusion processes by globally distributing all the particles lying at a lattice site. The global scattering is achieved by allowing the particles to execute unbiased spatial jumps with diffusive scaling, proportional to the square root of the simulation time step. When diffusion takes place in a velocity field, the diffusion step is preceded by a drift step which moves all the particles according to the velocity field at the lattice site. If the GRW procedure is applied to a single particle, it is equivalent to a PT procedure projected on a regular lattice. Thus, GRW can be thought as a superposition of PT procedures. Moreover, it has been shown that the GRW algorithm can also be implemented as a weak Euler scheme for the Ito equation governing the continuous diffusion process, which accurately reproduces the true probability distribution. The essential difference is that while the concentration field is estimated by post-processing the trajectories simulated sequentially in the PT approach, a single GRW simulation is required for concentration estimates. In fact, the output of the GRW simulation is not an ensemble of trajectories solving the Ito equation, rather it is a solution to the associated Fokker-Planck equation. The GRW algorithm saves memory and computing time and no restrictions are imposed to the total number of particles which ensures reliable concentration estimates.

For vanishing or constant drift coefficients, GRW is also equivalent with the stable finite-difference (FD) scheme and has the same convergence order for large enough numbers of particles. However, for space-variable drift this equivalence fails and GRW suffers from overshooting errors caused by particles jumping over lattice points with different velocities. Overshooting errors can be completely removed by allowing jumps only to first-neighbor lattice sites. This can be achieved with a biased-GRW, where the drift displacement is modeled as a bias in the jump probability.

The new algorithm is no longer a weak Euler scheme for the Ito equation, instead it is equivalent to a stable FD scheme without numerical diffusion. Removing the overshooting with biased-GRW has the drawback of high computational costs, due to the fine grids required by the first-neighbor jumps constraint. Therefore, the biased algorithm is mainly useful as reference to assess the accuracy of the coarser, but faster, unbiased GRW algorithms which are more efficient in solving large scale diffusion problems. This chapter includes a presentation of the GRW algorithm, with details on its derivation, implementation, equivalence with other schemes, sensitivity to parameters, and convergence properties.

Since the GRW approach is highly recommended for large scale simulations of advection-dominated transport processes, where PT has limited accuracy and finite element/difference schemes suffer from numerical diffusion, some relevant applications to contaminant transport in groundwater are also presented for the purpose of illustration.

## Authors

N. Suciu
-Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy

C. Vamoș
-Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy

## Keywords

Random walk; Probabilistic particle methods; Diffusion processes

## Cite this chapter as:

N. Suciu, C. Vamoş, Global random walk algorithm for diffusion processes, in A. Skogseid and V. Fasano, editors, Random Walks: Principles, Processes and Applications, pp. 341-388, Nova Science Publishers, New York, 2012.

## PDF

Not available yet.

##### Book

Statistical Mechanics and Random Walks: Principles, Processes and Applications

##### Publisher Name

Nova Science Publisher

##### Print ISBN

9781614709664, 9781614709879

?

?