Commit 22270d93 authored by Michael Wimmer's avatar Michael Wimmer
Browse files

fix typo

parent 3c978a03
Pipeline #58158 passed with stages
in 1 minute and 47 seconds
......@@ -182,7 +182,7 @@ is pure magic!
What we need to realize is that we pay for the generality of the Metropolis algorithm with **correlation**. In fact, the
degree of correlation is determined by the trial moves. A useful measure to determine the usefulness of a trial move is the
*acceptance ratio* $\alpha=\frac{\text{number of accepted moves}}{\text{number of total moves}}$$.
*acceptance ratio* $\alpha=\frac{\text{number of accepted moves}}{\text{number of total moves}}$.
Let us demonstrate this using a simple example, and use the Metropolis algorithm to generate a Markov chain that
samples a normal distribution $p(x) = (2 \pi \sigma)^{1/2} e^{-x^2/2\sigma}$. In this case, our configuration space
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment