Biased global random walk, a cellular automaton for diffusion (original) (raw)
2005
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
The new cellular automaton for diffusion presented in this paper is self-averaging and free of overshooting errors. These properties make it appropriate for the evaluation of the numerical methods which allow overshooting to optimize the efficiency. The perspective of parallelization and the possible extension to reaction-diffusion make the algorithm attractive as a tool for modelling complex transport processes.
Related papers
Monte Carlo Methods and Applications, 2004
The methods which track particles to simulate concentrations are successfully used in problems for large scale transport in groundwater, mainly when the aquifer properties are spatially heterogeneous and the process is advection dominated. These methods, sometimes called "analogical Monte Carlo methods", are not concerned with the numerical diffusion occurring in finite difference/element schemes. The limitations of classical random walk methods are due to large computation time and memory necessary to achieve statistically reliable results and accurate concentration fields. To overcome these computational limitations a "global random walk" (GRW) algorithm was developed. Unlike in the usual approach where the trajectory of each particle is simulated and stored, in GRW all the particles from a given grid node are scattered, at a given time, using a single numerical procedure, based on Bernoulli distribution, partial-deterministic, or deterministic rules. Because no restrictions are imposed for the maximum number of particles to be used in a simulation, the Monte Carlo repetitions are no longer necessary to achieve the convergence. It was proved that for simple diffusion problems GRW converges to the finite difference scheme and that for large scale transport problems in groundwater, GRW produces stable and statistically reliable simulations. A 2-dimensional transport problem was modeled by simulating local diffusion processes in realizations of a random velocity field. The behavior over 5000 days of the effective diffusion coefficients, concentration field and concentration fluctuations were investigated using 2560 realizations of the velocity field and 10 10 particles in every realization. The results confirm the order of magnitude of the effective diffusion coefficients predicted by stochastic theory but the time needed to reach the asymptotic regime was found to be thousands times larger. It is also underlined that the concentration fluctuations and the dilution of contaminant solute depend essentially on local diffusion and boundary conditions.
Cellular automaton models for time-correlated random walks: derivation and analysis
Many diffusion processes in nature and society were found to be anomalous, in the sense of being fundamentally different from conventional Brownian motion. An important example is the migration of biological cells, which exhibits non-trivial temporal decay of velocity autocorrelation functions. This means that the corresponding dynamics is characterized by memory effects that slowly decay in time. Motivated by this we construct non-Markovian lattice-gas cellular automata models for moving agents with memory. For this purpose the reorientation probabilities are derived from velocity autocorrelation functions that are given a priori; in that respect our approach is " data-driven ". Particular examples we consider are velocity correlations that decay exponentially or as power laws, where the latter functions generate anomalous diffusion. The computational efficiency of cellular automata combined with our analytical results paves the way to explore the relevance of memory and anomalous diffusion for the dynamics of interacting cell populations, like confluent cell monolayers and cell clustering.
Future Generation Computer Systems, 2001
We present a model based on cellular automata for the simulation of reaction–diffusion processes that has been applied to the percolation of pesticides in the soil. The main contribution of our approach consists of a model where chemical reactions and the movement of fluid particles in a porous medium can be explicitly described and simulated. In this paper we show how the model has been used to reproduce the process that causes release of pesticides contained in the soil after their application to crops, into water flowing through the soil and to be carried to the groundwater layer, polluting it. A parallel version of the model has been successfully implemented on Cray T3E and SGI Origin 2000 parallel computers.
Random Walks with negative particles for discontinuous diffusion and porosity
Journal of Computational Physics, 2019
This study develops a new Lagrangian particle method for modeling flow and transport phenomena in complex porous media with discontinuities. For instance, diffusion processes can be modeled by Lagrangian Random Walk algorithms. However, discontinuities and heterogeneities are difficult to treat, particularly discontinuous diffusion D (x) or porosity θ (x). In the literature on particle Random Walks, previous methods used to handle this discontinuity problem can be characterized into two main classes as follows: "Interpolation techniques", and "Partial reflection methods". One of the main drawbacks of these methods is the small time step required in order to converge to the expected solution, particularly in the presence of many interfaces. These restrictions on the time step, lead to inefficient algorithms. The Random Walk Particle Tracking (RWPT) algorithm proposed here is, like others in the literature, discrete in time and continuous in space (gridless). We propose a novel approach to partial reflection schemes without restrictions on time step size. The new RWPT algorithm is based on an adaptive "Stop&Go" time-stepping, combined with partial reflection/refraction schemes, and extended with a new concept of negative mass particles. To test the new RWPT scheme, we develop analytical and semi-analytical solutions for diffusion in the presence of multiple interfaces (discontinuous multi-layered medium). The results show that the proposed Stop&Go RWPT scheme (with adaptive negative mass particles) fits extremely well the semi-analytical solutions, even for very high contrasts and in the neighborhood of interfaces. The scheme provides a correct diffusive solution in only a few macro-time steps, with a precision that does not depend on their size.
Journal of Electrochemistry
Research on diffusion behaviors is of significant value in that it is closely related to transport phenomena in micro-chemistry. However, the effects of variables on diffusion are still unclear. Here, we developed and programmed a simulation methodology along with data analysis, which was capable to simulate the diffusion of a particle within twodimensional heterogeneous space in large timescale; the effects of periodically arranged impenetrable barriers of specific shape and lateral drifting velocity on diffusion behavior were studied. As well as standard mean square displacement analysis, a new method, the appearance probability distribution method, was introduced, which revealed whether the particle tended to be present at certain positions. This article introduced the construction of the simulation model and demonstrated the validity of the model. The results showed that our model fit qualitatively well with experiments and theories. The model was proved to be an excellent potential platform for simulating the diffusion behaviors in micro-chemistry, such as the diffusion process in electrochemistry as well as nanofiltration membrane.
A new method for choosing the computational cell in stochastic reaction–diffusion systems
2011
How to choose the computational compartment or cell size for the stochastic simulation of a reactiondiffusion system is still an open problem, and a number of criteria have been suggested. A generalized measure of the noise for finite-dimensional systems based on the largest eigenvalue of the covariance matrix of the number of molecules of all species has been suggested as a measure of the overall fluctuations in a multivariate system, and we apply it here to a discretized reaction-diffusion system. We show that for a broad class of first-order reaction networks this measure converges to the square root of the reciprocal of the smallest mean species number in a compartment at the steady state. We show that a suitably re-normalized measure stabilizes as the volume of a cell approaches zero, which leads to a criterion for the maximum volume of the compartments in a computational grid. We then derive a new criterion based on the sensitivity of the entire network, not just of the fastest step, that predicts a grid size that assures that the concentrations of all species converge to a spatially-uniform solution. This criterion applies for all orders of reactions and for reaction rate functions derived from singular perturbation or other reduction methods, and encompasses both diffusing and non-diffusing species. We show that this predicts the maximal volume found in the linear problems, and we illustrate our results with an example motivated by anterior-posterior pattern formation in Drosophila, and with several other examples.
We test the fidelity of modelling diffusion processes of finite-size particles in porous media, simulated numerically, by continuous time random walk (CTRW) of the same step size and waiting time distributions. The waiting times depend on particle size. We find that the CTRW predicts a universality-class normal-to-anomalous diffusion transition at different particle sizes. We show that the discrepancy is due to the change in connectivity (topology) of the porous media with increasing particle size. We propose a method to improve the CTRW model by adding anisotropy. This adjustment yields good agreement with the simulated diffusion process, reinstating the CTRW, with its advantages, as an appropriate model for diffusion in confined geometries.
A New Class of Cellular Automata for Reaction-Diffusion Systems
1993
We introduce a new class of cellular automata to model reaction-diffusion systems in a quantitatively correct way. The construction of the CA from the reaction-diffusion equation relies on a moving average procedure to implement diffusion, and a probabilistic table-lookup for the reactive part. The applicability of the new CA is demonstrated using the Ginzburg-Landau equation.
A Monte Carlo method for the simulation of first passage times of diffusion processes
Methodology and Computing in …, 2001
A reliable Monte Carlo method for the evaluation of ®rst passage times of diffusion processes through boundaries is proposed. A nested algorithm that simulates the ®rst passage time of a suitable tied-down process is introduced to account for undetected crossings that may occur inside each discretization interval of the stochastic differential equation associated to the diffusion. A detailed analysis of the performances of the algorithm is then carried on both via analytical proofs and by means of some numerical examples. The advantages of the new method with respect to a previously proposed numerical-simulative method for the evaluation of ®rst passage times are discussed. Analytical results on the distribution of tied-down diffusion processes are proved in order to provide a theoretical justi®cation of the Monte Carlo method.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
References (4)
- Vamos ¸, C., N. Suciu, and H. Vereecken: Generalized random walk algorithm for the numerical modeling of complex diffusion processes. Comp. Phys. 186(2) (2003), p. 527-544.
- Karapiperis, T. and B. Blankleider: Cellular automaton model of reaction-transport processes. Physica D 78 (1994), p. 30-64.
- Doering, C. R., W. Horsthemke, and J. Riordan: Nonequilibrium fluctuation-induced transport. Phys. Rev. Lett. 72(19) (1994), p. 2984-2987.
- Suciu N., C. Vamos ¸, J. Vanderborght, H. Hardelauf, and H. Vereecken: Numerical modeling of large scale transport of contaminant solutes using the global random walk algorithm. Monte Carlo Methods and Appl. 10(2) (2004), p. 155-179.
Related papers
Generalized random walk algorithm for the numerical modeling of complex diffusion processes
Journal of Computational Physics, 2003
A generalized form of the random walk algorithm to simulate diffusion processes is introduced. Unlike the usual approach, at a given time all the particles from a grid node are simultaneously scattered using the Bernoulli repartition. This procedure saves memory and computing time and no restrictions are imposed for the maximum number of particles to be used in simulations. We prove that for simple diffusion the method generalizes the finite difference scheme and gives the same precision for large enough number of particles. As an example, simulations of diffusion in random velocity field are performed and the main features of the stochastic mathematical model are numerically tested.
C.: Evaluation of overshooting errors in particle methods for diffusion by biased global random walk
2006
Abstract. The adjustment of grid steps which guarantees that particles methods yield no numerical diffusion inevitably induces overshooting errors in the solution of the par-abolic partial differential equations with space variable coefficients. In this paper, we give an evaluation of the overshooting errors of the “global random walk ” algorithm (GRW), a computational efficient method used in simulations for transport in envi-ronmental problems. The evaluation is performed by comparisons between the GRW solutions and those of the “biased global random walk ” algorithm (BGRW), a cellu-lar automaton, which is computational more expensive but is also free of overshooting errors. The reference problem, was the diffusive transport in a random velocity field, a model for the transport of the contaminant solutes in groundwater. The evaluation reveals that, for an optimum choice of the parameters, GRW results at times of practical interest lie in ranges of acceptable precision, for both th...
Global Random Walk Simulations of Diffusion
Scientific Computing, Validated Numerics, Interval Methods, 2001
Random walk methods are suitable to build up convergent solutions for reaction-diffusion problems and were successfully applied to simulations of transport processes in a random environment. The disadvantage is that, for realistic cases, these methods become time and memory expensive. To increase the computation speed and to reduce the required memory, we derived a "global random walk" method in which the particles at a given site of the grid are simultaneously scattered following the binomial Bernoulli repartition. It was found that the computation time is reduced three orders of magnitude with respect to individual random walk methods. Moreover, by suitable "microscopic balance" boundary conditions, we obtained good simulations of transport in unbounded domains, using normal size grids. The global random walk improves the statistical quality of simulations for diffusion processes in random fields. The method was tested by comparisons with analytical and finite difference solutions as well as with concentrations measured in "column experiments", used in laboratory study of soils' hydrogeological and chemical properties.
Global random walk modelling of transport in complex systems
Computing and Visualization in Science, 2007
The Global Random Walk algorithm performs simultaneously the tracking of large collections of particles and permits massive simulations at reasonable costs. Applications were developed for transport in systems with anisotropic, non-homogeneous, and randomly distributed parameters. As a first illustration we present simulations for diffusion in human skin. Further, a case study for contaminant transport in groundwater shows that the realizations of the transport process converge in mean square limit to a Gaussian diffusion. This investigation also indicates that the use of the Kraichnan routine, based on periodic random fields, yields reliable simulations of transport in Gaussian velocity fields.
EVALUATION OF OVERSHOOTING ERRORS IN PARTICLE METHODS FOR DIFFUSION BY BIASED GLOBAL RANDOM WALK
2000
The adjustment of grid steps which guarantees that particles methods yield no numerical diffusion inevitably induces overshooting errors in the solution of the par- abolic partial differential equations with space variable coefficients. In this paper, we give an evaluation of the overshooting errors of the "global random walk" algorithm (GRW), a computational efficient method used in simulations for transport in
Numeric solution of advection–diffusion equations by a discrete time random walk scheme
Numerical Methods for Partial Differential Equations
Explicit numerical finite difference schemes for partial differential equations are well known to be easy to implement but they are particularly problematic for solving equations whose solutions admit shocks, blowups and discontinuities. Here we present an explicit numerical scheme for solving non-linear advection-diffusion equations admitting shock solutions that is both easy to implement and stable. The numerical scheme is obtained by considering the continuum limit of a discrete time and space stochastic process for non-linear advection-diffusion. The stochastic process is well posed and this guarantees the stability of the scheme. Several examples are provided to highlight the importance of the formulation of the stochastic process in obtaining a stable and accurate numerical scheme.
Simulation of stochastic diffusion via first exit times
Journal of Computational Physics, 2015
In molecular biology it is of interest to simulate diffusion stochastically. In the mesoscopic model we partition a biological cell into voxels in an unstructured mesh. In each voxel the number of molecules is recorded at each time step and molecules can jump between neighboring voxels to model diffusion. The jump rates are computed by discretizing the diffusion equation on the unstructured mesh. If the mesh is of poor quality, due to a complicated cell geometry, standard discretization methods can generate negative jump coefficients, which no longer allows the interpretation as the probability to leave the subvolume. We propose a method based on the mean first exit time of a molecule from a subvolume, which guarantees positive jump coefficients. Two approaches to exit times, a global and a local one, are presented and tested in simulations with diffusion and chemical reactions on meshes of different quality in two dimensions.
2011
An approach to use general-purpose graphics processing units (GPGPU) using nVidia CUDA technology 1 to increase the performance of cellular automata is presented in this paper. Shown that the calculations on the GPU faster (more than one order of magnitude) in comparison with CPU calculations and a well-functioning C-code. Cellular automata with Margolus' neighborhood are used for the demonstration of general steps in CUDA simulations.