Guaranteeing total balance in Metropolis algorithm Monte Carlo simulations

It has been an open question whether these update schemes satisfy the weaker condition of total balance. In this work, we show that under fairly broad conditions, a large class of update schemes for the Metropolis algorithm, including the sequential and checkerboard schemes, do indeed satisfy total balance for important distributions. We also show that detailed balance itself can be satisfied by straightforward modifications to these schemes.