Abstract

Let omega be a walk in Z3. Let the endpoints of omega be fixed at x and gamma in Z3. Suppose that d(x, gamma )=maxi(Xi(x)-X i( gamma ) mod ) where X(i3(x)) is the ith coordinate of the vertex x in Z. Then the BFACF algorithm is ergodic for walks joining x and gamma , provided that d(x, gamma ))1.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call