A Geometric Interpretation of the Metropolis-Hastings Algorithm

Abstract

The Metropolis-Hastings algorithm transforms a given stochastic matrix into a reversible stochastic matrix with a prescribed stationary distribution. We show that this transformation gives the minimum distance solution in an L1 metric.