We address the problem of sampling colorings of a graph G by Markov chain simulation. For most of the article we restrict attention to proper q-colorings of a path on n vertices (in statistical physics terms, the one-dimensional q-state Potts model at zero temperature), though in later sections we widen our scope to general “H-colorings” of arbitrary graphs G. Existing theoretical analyses of the mixing time of such simulations relate mainly to a dynamics in which a random vertex is selected for updating at each step. However, experimental work is often carried out using systematic strategies that cycle through coordinates in a deterministic manner, a dynamics sometimes known as systematic scan. The mixing time of systematic scan seems more difficult to analyze than that of random updates, and little is currently known. In this article we go some way toward correcting this imbalance. By adapting a variety of techniques, we derive upper and lower bounds (often tight) on the mixing time of systematic scan. An unusual feature of systematic scan as far as the analysis is concerned is that it fails to be time reversible.
Ann. Appl. Probab.
16(1):
185-230
(February 2006).
DOI: 10.1214/105051605000000683
Aldous, D. (1982). Some inequalities for reversible Markov chains. J. London Math. Soc. (2) 25 564–576. MR657512 0489.60077 10.1112/jlms/s2-25.3.564 Aldous, D. (1982). Some inequalities for reversible Markov chains. J. London Math. Soc. (2) 25 564–576. MR657512 0489.60077 10.1112/jlms/s2-25.3.564
Aldous, D. and Fill, J. (1996). Reversible Markov chains and random walks on graphs. Available at http://oz.berkeley.edu/users/aldous/RWG/book.html. http://oz.berkeley.edu/users/aldous/RWG/book.html Aldous, D. and Fill, J. (1996). Reversible Markov chains and random walks on graphs. Available at http://oz.berkeley.edu/users/aldous/RWG/book.html. http://oz.berkeley.edu/users/aldous/RWG/book.html
Amit, Y. (1996). Convergence properties of the Gibbs sampler for perturbations of Gaussians. Ann. Statist. 24 122–140. MR1389883 0854.60066 10.1214/aos/1033066202 euclid.aos/1033066202 Amit, Y. (1996). Convergence properties of the Gibbs sampler for perturbations of Gaussians. Ann. Statist. 24 122–140. MR1389883 0854.60066 10.1214/aos/1033066202 euclid.aos/1033066202
Azuma, K. (1967). Weighted sums of certain dependent random variables. Tôhoku Math. J. 19 357–367. MR221571 0178.21103 10.2748/tmj/1178243286 euclid.tmj/1178243286 Azuma, K. (1967). Weighted sums of certain dependent random variables. Tôhoku Math. J. 19 357–367. MR221571 0178.21103 10.2748/tmj/1178243286 euclid.tmj/1178243286
Benjamini, I., Berger, N., Hoffman, C. and Mossel, E. (2005). Mixing times of the biased card shuffling and the asymmetric exclusion process. Trans. Amer. Math. Soc. 357 3013–3029. MR2135733 1071.60095 10.1090/S0002-9947-05-03610-X Benjamini, I., Berger, N., Hoffman, C. and Mossel, E. (2005). Mixing times of the biased card shuffling and the asymmetric exclusion process. Trans. Amer. Math. Soc. 357 3013–3029. MR2135733 1071.60095 10.1090/S0002-9947-05-03610-X
Bubley, R. and Dyer, M. (1997). Path coupling: A technique for proving rapid mixing in Markov chains. Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science 223–231. 1321.68378 Bubley, R. and Dyer, M. (1997). Path coupling: A technique for proving rapid mixing in Markov chains. Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science 223–231. 1321.68378
Cooper, C., Dyer, M. and Frieze, A. (2001). On Markov chains for randomly $H$-colouring a graph. J. Algorithms 39 117–134. MR1823658 10.1006/jagm.2000.1142 Cooper, C., Dyer, M. and Frieze, A. (2001). On Markov chains for randomly $H$-colouring a graph. J. Algorithms 39 117–134. MR1823658 10.1006/jagm.2000.1142
Diaconis, P. and Ram, A. (2000). Analysis of systematic scan metropolis algorithm using Iwahori–Hecke algebra techniques. Michigan Math. J. 48 157–190. MR1786485 0998.60069 10.1307/mmj/1030132713 euclid.mmj/1030132713 Diaconis, P. and Ram, A. (2000). Analysis of systematic scan metropolis algorithm using Iwahori–Hecke algebra techniques. Michigan Math. J. 48 157–190. MR1786485 0998.60069 10.1307/mmj/1030132713 euclid.mmj/1030132713
Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696–730. MR1233621 0799.60058 10.1214/aoap/1177005359 euclid.aoap/1177005359 Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696–730. MR1233621 0799.60058 10.1214/aoap/1177005359 euclid.aoap/1177005359
Diaconis, P. and Stroock, D. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 36–61. MR1097463 0731.60061 10.1214/aoap/1177005980 euclid.aoap/1177005980 Diaconis, P. and Stroock, D. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 36–61. MR1097463 0731.60061 10.1214/aoap/1177005980 euclid.aoap/1177005980
Durrett, R. (1991). Probability: Theory and Examples. Brooks/Cole Publishing Company. MR1068527 0709.60002 Durrett, R. (1991). Probability: Theory and Examples. Brooks/Cole Publishing Company. MR1068527 0709.60002
Dyer, M., Frieze, A. and Jerrum, M. (2002). On counting independent sets in sparse graphs. SIAM J. Comput. 31 1527–1541. MR1936657 1041.68045 10.1137/S0097539701383844 Dyer, M., Frieze, A. and Jerrum, M. (2002). On counting independent sets in sparse graphs. SIAM J. Comput. 31 1527–1541. MR1936657 1041.68045 10.1137/S0097539701383844
Dyer, M., Goldberg, L. A., Greenhill, C., Jerrum, M. and Mitzenmacher, M. (2001). An extension of path coupling and its application to the Glauber dynamics for graph colorings. SIAM J. Comput. 30 1962–1975. MR1856564 0999.05035 10.1137/S0097539700372708 Dyer, M., Goldberg, L. A., Greenhill, C., Jerrum, M. and Mitzenmacher, M. (2001). An extension of path coupling and its application to the Glauber dynamics for graph colorings. SIAM J. Comput. 30 1962–1975. MR1856564 0999.05035 10.1137/S0097539700372708
Dyer, M., Jerrum, M. and Vigoda, E. (2004). Rapidly mixing Markov chains for dismantleable constraint graphs. In Proceedings of a DIMACS/DIMATIA Workshop on Graphs, Morphisms and Statistical Physics (J. Nesetril and P. Winkler, eds.). 1061.05031 Dyer, M., Jerrum, M. and Vigoda, E. (2004). Rapidly mixing Markov chains for dismantleable constraint graphs. In Proceedings of a DIMACS/DIMATIA Workshop on Graphs, Morphisms and Statistical Physics (J. Nesetril and P. Winkler, eds.). 1061.05031
Fill, J. A. (1991). Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1 62–87. MR1097464 0726.60069 10.1214/aoap/1177005981 euclid.aoap/1177005981 Fill, J. A. (1991). Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1 62–87. MR1097464 0726.60069 10.1214/aoap/1177005981 euclid.aoap/1177005981
Fishman, G. S. (1996). Coordinate selection rules for Gibbs sampling. Ann. Appl. Probab. 6 444–465. MR1398053 0855.60060 10.1214/aoap/1034968139 euclid.aoap/1034968139 Fishman, G. S. (1996). Coordinate selection rules for Gibbs sampling. Ann. Appl. Probab. 6 444–465. MR1398053 0855.60060 10.1214/aoap/1034968139 euclid.aoap/1034968139
Glauber, R. J. (1963). Time-dependent statistics of the Ising model. J. Math. Phys. 4 294–307. MR148410 0145.24003 10.1063/1.1703954 Glauber, R. J. (1963). Time-dependent statistics of the Ising model. J. Math. Phys. 4 294–307. MR148410 0145.24003 10.1063/1.1703954
Goldberg, L. A., Kelk, S. and Paterson, M. (2004). The complexity of choosing an $H$-colouring (nearly) uniformly at random. SIAM J. Comput. 33 416–432. MR2048449 10.1137/S0097539702408363 Goldberg, L. A., Kelk, S. and Paterson, M. (2004). The complexity of choosing an $H$-colouring (nearly) uniformly at random. SIAM J. Comput. 33 416–432. MR2048449 10.1137/S0097539702408363
Goldberg, L. A., Martin, R. and Paterson, M. (2004). Random sampling of $3$-colourings in $\mathbb{Z}^2$. Random Structures Algorithms 24 279–302. MR2068870 10.1002/rsa.20002 Goldberg, L. A., Martin, R. and Paterson, M. (2004). Random sampling of $3$-colourings in $\mathbb{Z}^2$. Random Structures Algorithms 24 279–302. MR2068870 10.1002/rsa.20002
Jerrum, M. (1995). A very simple algorithm for estimating the number of $k$-colourings of a low-degree graph. Random Structures Algorithms 7 157–165. MR1369061 10.1002/rsa.3240070205 Jerrum, M. (1995). A very simple algorithm for estimating the number of $k$-colourings of a low-degree graph. Random Structures Algorithms 7 157–165. MR1369061 10.1002/rsa.3240070205
Luby, M., Randall, D. and Sinclair, A. J. (2001). Markov chain algorithms for planar lattice structures. SIAM J. Comput. 31 167–192. MR1857394 0992.82013 10.1137/S0097539799360355 Luby, M., Randall, D. and Sinclair, A. J. (2001). Markov chain algorithms for planar lattice structures. SIAM J. Comput. 31 167–192. MR1857394 0992.82013 10.1137/S0097539799360355
Sinclair, A. (1992). Improved bounds for mixing rates of Markov chains and multicommodity flow. Combin. Probab. Comput. 1 351–370. MR1211324 0801.90039 10.1017/S0963548300000390 Sinclair, A. (1992). Improved bounds for mixing rates of Markov chains and multicommodity flow. Combin. Probab. Comput. 1 351–370. MR1211324 0801.90039 10.1017/S0963548300000390
Sinclair, A. and Jerrum, M. (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput. 82 93–133. MR1003059 0668.05060 10.1016/0890-5401(89)90067-9 Sinclair, A. and Jerrum, M. (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput. 82 93–133. MR1003059 0668.05060 10.1016/0890-5401(89)90067-9
van den Berg, J. (1993). A uniqueness condition for Gibbs measures, with application to the $2$-dimensional Ising antiferromagnet. Commun. Math. Phys. 152 161–166. MR1207673 10.1007/BF02097061 euclid.cmp/1104252313 van den Berg, J. (1993). A uniqueness condition for Gibbs measures, with application to the $2$-dimensional Ising antiferromagnet. Commun. Math. Phys. 152 161–166. MR1207673 10.1007/BF02097061 euclid.cmp/1104252313
Wilson, D. B. (2004). Mixing times of lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 14 274–325. MR2023023 1040.60063 10.1214/aoap/1075828054 euclid.aoap/1075828054 Wilson, D. B. (2004). Mixing times of lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab. 14 274–325. MR2023023 1040.60063 10.1214/aoap/1075828054 euclid.aoap/1075828054