We propose an efficient Markov Chain Monte Carlo method for sampling
equilibrium distributions for stochastic lattice models, capable of handling correctly
long and short-range particle interactions. The proposed method is a Metropolistype
algorithm with the proposal probability transition matrix based on the coarsegrained
approximating measures introduced in [17, 21]. We prove that the proposed
algorithm reduces the computational cost due to energy differences and has comparable
mixing properties with the classical microscopic Metropolis algorithm, controlled
by the level of coarsening and reconstruction procedure. The properties and
effectiveness of the algorithm are demonstrated with an exactly solvable example
of a one dimensional Ising-type model, comparing efficiency of the single spin-flip
Metropolis dynamics and the proposed coupled Metropolis algorithm.
Kalligiannaki, E; Katsoulakis, MA; and Plechac, P, "Coupled coarse graining and Markov Chain Monte Carlo for lattice systems" (2010). Mathematics and Statistics Department Faculty Publication Series. 1182.
Retrieved from https://scholarworks.umass.edu/math_faculty_pubs/1182