Abstract
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parameters bounding these influences — α, the total influence on a site, as studied by Dobrushin; α′, the total influence of a site, as studied by Dobrushin and Shlosman; and α′′, the total influence of a site in any given context, which is related to the path-coupling method of Bubley and Dyer. It is known that if any of these parameters is less than 1 then random-update Glauber dynamics (in which a randomly-chosen site is updated at each step) is rapidly mixing. It is also known that the Dobrushin condition α<1 implies that systematic-scan Glauber dynamics (in which sites are updated in a deterministic order) is rapidly mixing. This paper studies two related issues, primarily in the context of systematic scan: (1) the relationship between the parameters α, α′ and α′′, and (2) the relationship between proofs of rapid mixing using Dobrushin uniqueness (which typically use analysis techniques) and proofs of rapid mixing using path coupling. We use matrix-balancing to show that the Dobrushin-Shlosman condition α′ < 1 implies rapid mixing of systematic scan. An interesting question is whether the rapid mixing results for scan can be extended to the α= 1 or α′ = 1 case. We give positive results for the rapid mixing of systematic scan for certain α= 1 cases. As an application, we show rapid mixing of systematic scan (for any scan order) for heat-bath Glauber dynamics for proper q-colourings of a degree-Δ graph G when q ≥2Δ.
Partially supported by the EPSRC grant Discontinuous Behaviour in the Complexity of Randomized Algorithms. Some of the work was done while the authors were visiting the Mathematical Sciences Research Institute in Berkeley. A full version, with all proofs, appears at http://www.eccc.uni-trier.de/eccc-reports/2005/TR05-075/index.html
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aldous, D.: Some inequalities for reversible Markov chains. J. London Math. Society 25(2), 564–576 (1982)
Bubley, R., Dyer, M.: Path coupling: a technique for proving rapid mixing in Markov chains. In: FOCS, vol. 38, pp. 223–231 (1997)
Cho, G.E., Meyer, C.D.: Markov chain sensitivity measured by mean first passage times. Linear Algebra and its Applications 316(1–3), 21–28 (2000)
Cho, G.E., Meyer, C.D.: Comparison of perturbation bounds for the stationary distribution of a Markov chain. Linear Algebra and its Applications 335(1–3), 137–150 (2001)
Diaconis, P., Saloff-Coste, L.: Comparison theorems for reversible Markov chains. Annals of Applied Probability 3, 696–730 (1993)
Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability 1, 36–61 (1991)
Dobrushin, R.L.: Prescribing a system of random variables by conditional distributions. Theory Prob. and its Appl. 15, 458–486 (1970)
Dobrushin, R.L., Shlosman, S.B.: Constructive criterion for the uniqueness of a Biggs field. In: Fritz, J., Jaffe, A., Szasz, D. (eds.) Statistical mechanics and dynamical systems, pp. 347–370. Birkhauser, Boston (1985)
Dyer, M., Goldberg, L.A., Jerrum, M.: Systematic scan for sampling colourings. Annals of Applied Probability (to appear)
Dyer, M., Goldberg, L.A., Jerrum, M., Martin, R.: Markov chain comparison (preprint, 2004)
Dyer, M., Greenhill, C.: Random walks on combinatorial objects. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 267, pp. 101–136. Cambridge University Press, Cambridge (1999)
Föllmer, H.: A covariance estimate for Gibbs measures. J. Funct. Analys. 46, 387–395 (1982)
Lovśz, L., Winkler, P.: Mixing of random walks and other diffusions on a graph. In: Rowlinson, P. (ed.) Surveys in Combinatorics. London Math. Soc. Lecture Note Series, vol. 218, pp. 119–154 (1995)
Martin, R., Randall, D.: Sampling adsorbing staircase walks using a new Markov chain decomposition method. In: Proc. of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2000), pp. 492–502 (2000)
Pedersen, K.: Personal communication
Salas, J., Sokal, A.D.: Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem. J. Statistical Physics 86, 551–579 (1997)
Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing 1, 351–370 (1992)
Simon, B.: The Statistical Mechanics of Lattice Gases. Princeton University Press, Princeton (1993)
Sokal, A.: A personal list of unsolved problems concerning lattice gases and antiferromagnetic potts models. Markov Processes and Related Fields (to appear)
Weitz, D.: Combinatorial Criteria for Uniqueness of Gibbs Measures. Random Structures and Algorithms (to appear, 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dyer, M., Goldberg, L.A., Jerrum, M. (2006). Dobrushin Conditions and Systematic Scan. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2006 2006. Lecture Notes in Computer Science, vol 4110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11830924_31
Download citation
DOI: https://doi.org/10.1007/11830924_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38044-3
Online ISBN: 978-3-540-38045-0
eBook Packages: Computer ScienceComputer Science (R0)