Coupled coarse graining and Markov Chain Monte Carlo for lattice systems

Mathematics – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages, 4 figures

Scientific paper

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 Metropolis-type algorithm with the proposal probability transition matrix based on the coarse-grained approximating measures introduced in a series of works of M. Katsoulakis, A. Majda, D. Vlachos and P. Plechac, L. Rey-Bellet and D.Tsagkarogiannis,. 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Coupled coarse graining and Markov Chain Monte Carlo for lattice systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coupled coarse graining and Markov Chain Monte Carlo for lattice systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coupled coarse graining and Markov Chain Monte Carlo for lattice systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-261342

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.