Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Is there any MCMC mathod that allow me to uniformly sample from all feasible walks where the following restrictions apply:

1. visit vertex {1,2,3,..n} x1,x2,...,xn times
2. Doesn't go back in 1 step: i.e. no self loop
3. Doesn't go back in 2 steps: i.e. cannot have 1,2,3,2,....

Is following transposition chain irreducible?

randomly pick 2 vertices, swap them if possible.

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.