How to accept states

Assume that the program starts with a point then generates a dif- 

This means that the Metropolis method proceeds from to with an acceptance probability min(l, pn/pm)- If the new point has a higher probability than the previous one, then the algorithm accepts it and includes it in the chain of outcomes. If the new point has a lower probability the algorithm accepts it with a probability equal to Pn/Pm- 

The Metropolis transition probability is defined with the help of the attempt and acceptance probabilities as follows  

For dll NVT system the relative frequency of each configuration is proportional to the corresponding Boltzmann factor. The Metropolis transition probability becomes, assuming n = m, 

The configurational integral, Z(A/, V, T), cancels out and the transition matrix elements are 

---