Metropolis algorithm and equienergy sampling for two mean field spin systems

Details Metropolis algorithm and equienergy sampling for two mean field spin systems Metropolis algorithm and equienergy sampling for two mean field spin systems

2007-04-06

arxiv.org/abs/0704.0906v2

Mathematics

Probability

Scientific paper

In this paper we study the Metropolis algorithm in connection with two mean--field spin systems, the so called mean--field Ising model and the Blume--Emery--Griffiths model. In both this examples the naive choice of proposal chain gives rise, for some parameters, to a slowly mixing Metropolis chain, that is a chain whose spectral gap decreases exponentially fast (in the dimension $N$ of the problem). Here we show how a slight variant in the proposal chain can avoid this problem, keeping the mean computational cost similar to the cost of the usual Metropolis. More precisely we prove that, with a suitable variant in the proposal, the Metropolis chain has a spectral gap which decreases polynomially in 1/N. Using some symmetry structure of the energy, the method rests on allowing appropriate jumps within the energy level of the starting state.

Affiliated with

Also associated with

No associations

Rating

Metropolis algorithm and equienergy sampling for two mean field spin 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 Metropolis algorithm and equienergy sampling for two mean field spin systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Metropolis algorithm and equienergy sampling for two mean field spin systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-700058