# Flipping more than one spin in Metropolis Monte Carlo algorithms

In lattice systems such as Ising model or spin glasses, the standard Monte Carlo simulation with Metropolis algorithm works by proposig a single spin flip and then accepting or rejecting the proposal with the probability given by the algorithm itself.

I'd like to know if anything changes when the proposal changes from a single spin flip to a group of spins (choosen randomly and independently at each step, but fixed in number).

In other words, suppose that we suggest a flip of N spins. Then we measure the new energy and then use the standard Metropolis choice for the acceptance.

1. Does this change the equilibrium probability distribution?
2. If (1) is yes, does this make the algorithm any faster?
• See Swendsen-Wang and Wolff cluster flip algorithms. – JamalS Jun 25 '18 at 16:31
• From what I get from the two algorithms, they are quite different from the one in the question. Should I assume that therefore the Metropolis algorithm can’t be generalized that way? – Drebin J. Jun 25 '18 at 18:56