The Metropolis-Hastings algorithm is a generalization of the older Metropolis algorithm. As part of these algorithms, they compute a ratio called the Metropolis ratio:
$$ r = \frac{P(x')}{P(x)}\frac{g(x | x')}{g(x' | x)} $$
where $g()$ are the proposal distributions and $P()$ the transition probabilities (or likelihoods at the different trial parameter values, $x$ and $x'$). For the Metropolis algorithm, the $g()$'s are referred to as symmetrical (and therefore cancel out) whereas, in the Hastings variant, they are asymmetrical and don't cancel out.
Can someone explain in plain language what is the meaning of symmetric and asymmetric in this situation? I thought at one point it referred to the symmetry of the normal distribution used to draw the values but according to the answer below that is not the case. Most of the books and blogs I've read are very obscure on this matter.
And related, how does one compute the asymmetric ratio in code, eg Python?
I found this question: What is the deeper intuition behind the symmetric proposal distribution in the Metropolis-Hastings Algorithm?
that almost gives me a plain answer but not quite, the key sentence seems to be: "If one uses a Normal distribution not centered at the previous value in the Metropolis-Hastings proposal (as e.g. in the Langevin version), the Normal distribution remains symmetric as a distribution but the proposal distribution is no longer symmetric " but I'm not entirely sure what it means especially with reference to actually computing the asymmetric ratio.