Abstract
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.
This work was partly funded by EPSRC projects GR/T07343/02 and GR/S76168/01. A longer version, with all proofs included, is available at http://www.csc.liv.ac.uk/~kasper http:// http://www.csc.liv.ac.uk/~kasper www.csc.liv.ac.uk/~kasper
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
Dyer, M., Goldberg, L.A., Jerrum, M.: Dobrushin conditions and systematic scan. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 327–338. Springer, Heidelberg (2006)
Dyer, M., Goldberg, L.A., Jerrum, M.: Systematic scan and sampling colourings. Annals of Applied Probability 16(1), 185–230 (2006)
Bordewich, M., Dyer, M., Karpinski, M.: Stopping times, metrics and approximate counting. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 108–119. Springer, Heidelberg (2006)
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)
Weitz, D.: Mixing in Time and Space for Discrete Spin Systems. PhD thesis, University of California, Berkley (2004)
Weitz, D.: Combinatorial criteria for uniqueness of Gibbs measures. Random Structures and Algorithms 27(4), 445–475 (2005)
Dyer, M., Sinclair, A., Vigoda, E., Weitz, D.: Mixing in time and space for lattice spin systems: A combinatorial view. Random Structures and Algorithms 24(4), 461–479 (2004)
Dobrushin, R.L.: Prescribing a system of random variables by conditional distributions. Theory Prob. and its Appl. 15, 458–486 (1970)
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)
Simon, B.: The Statistical Mechanics of Lattice Gases. Princeton University Press, Princeton (1993)
Pedersen, K.: Dobrushin conditions for systematic scan with block dynamics. arXiv:math.PR/0703461 (2007)
Vigoda, E.: Improved bounds for sampling colourings. J. Math. Phys (2000)
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)
Dyer, M., Goldberg, L.A., Jerrum, M.: Matrix norms and rapid mixing for spin systems. ArXiv math.PR/0702744 (2006)
Martinelli, F., Sinclair, A., Weitz, D.: Glauber dynamics on trees: Boundary conditions and mixing time. Communications in Mathematical Physics 250(2), 301–334 (2004)
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)
Föllmer, H.: A covariance estimate for Gibbs measures. J. Funct. Analys. 46, 387–395 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedersen, K. (2007). Dobrushin Conditions for Systematic Scan with Block Dynamics. In: Kučera, L., Kučera, A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-74456-6_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74455-9
Online ISBN: 978-3-540-74456-6
eBook Packages: Computer ScienceComputer Science (R0)