To prove that the Metropolis algorithm generates a sequence of
random numbers distributed according to
consider a large number of walkers
starting from different initial points and moving independently.
If
is the density of those walkers at
after
steps
then the net number of walkers moving from point
to point
in the
next step is
To show that the algorithm leads
to an equilibrium distribution of walkers proportional to take
the probability of making a step to
as
From the algorithm,, if , then
and
The walkers are distributed with the correct
distribution. This proves that the walkers will generate a
distribution of points in space which will be distributed
according to the weight function
.
Michel Vallieres 2014-04-01