A relatively quick way to simulate local random processes on a lattice

DOI10.1239/JAP/1032265224MaRDI QIDQ4228280zbMATH OpenOpenAlexFDO

Authors Daniel C. Richardson, Wayne Burton

Publication date 17 August 1999

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1239/jap/1032265224

zbMATH Keywords

latticesimulationpercolationheap

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to probability theory (60-04) Continuous-time Markov processes on general state spaces (60J25)

Recommendations

• Simulation of branching random walks on a multidimensional lattice
• Note on the Metropolis Monte Carlo method on random lattices
• scientific article; zbMATH DE number 1728257
• Numerical simulations for stochastic lattice equations
• On representations and simulation of conditioned random walks on integer lattices
• Fast approximate simulation of finite long-range spin systems
• Simulating kinetic processes in time and space on a lattice
• Publication:3488994

Cited in

(2)

• Simple one-dimensional interaction systems with superexponential relaxation times.
• Variable-length analog of Stavskaya process: a new example of misleading simulation

This page was built for publication: A relatively quick way to simulate local random processes on a lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228280)