Dobrushin Conditions and Systematic Scan
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Δ.
KeywordsMarkov Chain Transition Matrix Spin System Full Version Glauber Dynamic
Unable to display preview. Download preview PDF.
- 2.Bubley, R., Dyer, M.: Path coupling: a technique for proving rapid mixing in Markov chains. In: FOCS, vol. 38, pp. 223–231 (1997)Google Scholar
- 8.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)Google Scholar
- 9.Dyer, M., Goldberg, L.A., Jerrum, M.: Systematic scan for sampling colourings. Annals of Applied Probability (to appear)Google Scholar
- 10.Dyer, M., Goldberg, L.A., Jerrum, M., Martin, R.: Markov chain comparison (preprint, 2004)Google Scholar
- 11.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)Google Scholar
- 13.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)Google Scholar
- 14.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)Google Scholar
- 15.Pedersen, K.: Personal communicationGoogle Scholar
- 19.Sokal, A.: A personal list of unsolved problems concerning lattice gases and antiferromagnetic potts models. Markov Processes and Related Fields (to appear)Google Scholar
- 20.Weitz, D.: Combinatorial Criteria for Uniqueness of Gibbs Measures. Random Structures and Algorithms (to appear, 2005)Google Scholar