Dobrushin Conditions for Systematic Scan with Block Dynamics
We study the mixing time of systematic scan Markov chains on finite spin systems. It is known that, in a single site setting, the mixing time of systematic scan can be bounded in terms of the influences sites have on each other. We generalise this technique for bounding the mixing time of systematic scan to block dynamics, a setting in which a set of sites are updated simultaneously. In particular we present a parameter α, representing the maximum influence on any site, and show that if α< 1 then the corresponding systematic scan Markov chain mixes rapidly. We use this method to prove O(logn) mixing of a systematic scan for proper q-colourings of a general graph with maximum vertex-degree Δ whenever q ≥ 2Δ. We also apply the method to improve the number of colours required in order to obtain mixing in O(logn) scans for a systematic scan colouring of trees.
KeywordsMarkov Chain Transition Matrix Spin System Gibbs Measure General Graph
Unable to display preview. Download preview PDF.
- 4.Dobrushin, R.L., Shlosman, S.B.: Constructive criterion for the uniqueness of Gibbs field. In: Statistical mechanics and dynamical systems, Progress in Physics, vol. 10, pp. 371–403. Birkhäuser, Boston (1985)Google Scholar
- 5.Weitz, D.: Mixing in Time and Space for Discrete Spin Systems. PhD thesis, University of California, Berkley (2004)Google Scholar
- 9.Aldous, D.J: Random walks on finite groups and rapidly mixing markov chains. In: Séminaire de probabilités XVII, pp. 243–297. Springer, Heidelberg (1983)Google Scholar
- 11.Pedersen, K.: Dobrushin conditions for systematic scan with block dynamics. arXiv:math.PR/0703461 (2007)Google Scholar
- 12.Vigoda, E.: Improved bounds for sampling colourings. J. Math. Phys (2000)Google Scholar
- 13.Hayes, T.P.: A simple condition implying rapid mixing of single-site dynamics on spin systems. In: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 39–46. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
- 14.Dyer, M., Goldberg, L.A., Jerrum, M.: Matrix norms and rapid mixing for spin systems. ArXiv math.PR/0702744 (2006)Google Scholar
- 16.Kenyon, C., Mossel, E., Peres, Y.: Glauber dynamics on trees and hyperbolic graphs. In: Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 568–578. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar