Systematic scan for sampling colorings

dc.creatorDyer, Martin
dc.creatorGoldberg, Leslie Ann
dc.creatorJerrum, Mark
dc.date2006-03-14
dc.date.accessioned2026-07-07T07:06:50Z
dc.date.available2026-07-07T07:06:50Z
dc.descriptionWe 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.
dc.descriptionPublished at http://dx.doi.org/10.1214/105051605000000683 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
dc.identifierhttps://arxiv.org/abs/math/0603323
dc.identifierhttp://arxiv.org/abs/math/0603323
dc.identifierAnnals of Applied Probability 2006, Vol. 16, No. 1, 185-230
dc.identifierdoi:10.1214/105051605000000683
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/110175
dc.subjectProbability
dc.subject60J10 (Primary) 05C15, 60C15, 68Q25, 68W20, 82B20 (Secondary)
dc.titleSystematic scan for sampling colorings
dc.typetext

Files

Collections