Metropolis Algorithm 2.
What are the transition probabilities for this algorithm?
- Without loss of generality, define i as the state of greater probability
-
-
Do they obey detailed balance?
Yes, as long as the underlying matrix T of the Markov chain is symmetric
- this can be violated, but acceptance probabilities must be modified