Multiple Random Walk Simulation: A Fast Method to Map Grade Uncertainty with Large Datasets

Abstract

Multiple Random Walk Simulation consists of a methodology adapted to run fast simulations if close-spaced data are abundant (e.g., short-term mining models). Combining kriging with the simulation of random walks attempts to approximate traditional simulation algorithm results but at a computationally faster way when there is a large amount of conditioning samples. This paper presents this new algorithm illustrating the situations where the method can be used properly. A synthetic study case is presented in order to illustrate the Multiple Random Walk Simulation and to analyze the speed and goodness of its results against the ones from using Turning Bands Simulation and Sequential Gaussian Simulation.