Random Walks on Combinatorial Objects
Random Walks on Combinatorial Objects
Summary Approximate sampling from combinatorially-defined sets, using the Markov chain Monte Carlo method, is discussed from the perspective of combinatorial algorithms. We also examine the associated problem of discrete integration over such sets. Recent work is reviewed, and we re-examine the underlying formal foundational framework in the light of this. …