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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
