Path coupling: A technique for proving rapid mixing in Markov chains

This publication has 9 references indexed in Scilit:

• Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
  Journal of Statistical Physics, 1997
• Approximately counting up to four (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1997
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
  Random Structures & Algorithms, 1995
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
  Random Structures & Algorithms, 1995
• A random polynomial-time algorithm for approximating the volume of convex bodies
  Journal of the ACM, 1991
• Monte-Carlo algorithms for enumeration and reliability problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Random walks on finite groups and rapidly mixing markov chains
  Published by Springer Nature ,1983
• The Complexity of Enumeration and Reliability Problems
  SIAM Journal on Computing, 1979
• WITHDRAWN: Chapter 19 Chromatic Number of a Hypergraph
  Published by Elsevier ,1973