Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs

  • Martin Dyer
  • Mark Jerrum
  • Eric Vigoda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2483)


If G = (V G ,E G ) is an input graph, and H = (V h,Eh) a fixed constraint graph, we study the set Ω of homomorphisms (or colorings) from V g to V h, i.e., functions that preserve adjacency. Brightwell and Winkler introduced the notion of dismantleable constraint graph to characterize those H whose associated set Ω of homomorphisms is, for every G, connected under single vertex recolorings. Given fugacities λ(c) > 0 (c ∈ V h) our focus is on sampling a coloring ω Ω according to the Gibbs distribution, i.e., with probability proportional to Πυ∈V Gλ(ω(υ)). The Glauber dynamics is a Markov chain on Ω which recolors a single vertex at each step, and leaves invariant the Gibbs distribution. We prove that, for each dismantleable H and degree bound Δ, there exist positive constant fugacities on V h such that the Glauber dynamics has mixing time O(n 2), for all graphs G whose vertex degrees are bounded by Δ.


Markov Chain Stationary Distribution Variant Dynamic Markov Chain Monte Carlo Method Input Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. R. Brightwell and P. Winkler. Gibbs measures and dismantleable graphs. J. Combin. Theory Ser. B, 78(1):141–166, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    R. Bubley and M. Dyer. Path coupling, Dobrushin uniqueness, and approximate counting. In 38th Annual Symposium on Foundations of Computer Science, pages 223–231, Miami Beach, FL, October 1997. IEEE.Google Scholar
  3. 3.
    C. Cooper, M. Dyer, and A. Frieze. On Markov chains for randomly H-coloring a graph. J. Algorithms, 39(1):117–134, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    P. Diaconis and L. Saloff-Coste. Comparison theorems for reversible Markov chains. The Annals of Applied Probability, 3(3):696–730, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    M. Dyer, L.A. Goldberg and M. Jerrum. Counting and Sampling H-colourings. To appear in Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, Springer-Verlag LNCS, September 2002.Google Scholar
  6. 6.
    M. Dyer and C. Greenhill. The complexity of counting graph homomorphisms. Random Structures Algorithms, 17(3-4):260–289, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    M. E. Dyer, L. A. Goldberg, C. S. Greenhill, and M. R. Jerrum. On the relative complexity of approximate counting problems. In Proceedings of APPROX 2000, Lecture Notes in Computer Science vol. 1913, pages 108–119, Springer Verlag, 2000.Google Scholar
  8. 8.
    M. Jerrum. Mathematical foundations of the Markov chain Monte Carlo method. In Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. Mc-Diarmid, J. Ramirez-Alfonsin & B. Reed, eds), Algorithms and Combinatorics vol. 16, Springer-Verlag, 1998, 116–165.Google Scholar
  9. 9.
    D. Randall and P. Tetali. Analyzing Glauber dynamics by comparison of Markov chains. J. Math. Phys., 41(3):1598–1615, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    A. Sinclair. Improved bounds for mixing rates of Markov chains and multicom-modity flow. Combinatorics, Probability and Computing, 1(4):351–370, 1992.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Martin Dyer
    • 1
  • Mark Jerrum
    • 2
  • Eric Vigoda
    • 3
  1. 1.School of ComputingUniversity of LeedsLeedsUK
  2. 2.Laboratory for Foundations of Computer ScienceUniversity of EdinburghEdinburghUK
  3. 3.Department of Computer ScienceUniversity of ChicagoChicagoUSA

Personalised recommendations