Matrix norms and rapid mixing for spin systems

Simple item page
dc.creatorDyer, Martin
dc.creatorGoldberg, Leslie Ann
dc.creatorJerrum, Mark
dc.date2007-02-25
dc.date2009-02-27
dc.date.accessioned2026-07-07T12:49:27Z
dc.date.available2026-07-07T12:49:27Z
dc.descriptionWe give a systematic development of the application of matrix norms to rapid mixing in spin systems. We show that rapid mixing of both random update Glauber dynamics and systematic scan Glauber dynamics occurs if any matrix norm of the associated dependency matrix is less than 1. We give improved analysis for the case in which the diagonal of the dependency matrix is $\mathbf{0}$ (as in heat bath dynamics). We apply the matrix norm methods to random update and systematic scan Glauber dynamics for coloring various classes of graphs. We give a general method for estimating a norm of a symmetric nonregular matrix. This leads to improved mixing times for any class of graphs which is hereditary and sufficiently sparse including several classes of degree-bounded graphs such as nonregular graphs, trees, planar graphs and graphs with given tree-width and genus.
dc.descriptionPublished in at http://dx.doi.org/10.1214/08-AAP532 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/0702744
dc.identifierhttp://arxiv.org/abs/math/0702744
dc.identifierAnnals of Applied Probability 2009, Vol. 19, No. 1, 71-107
dc.identifierdoi:10.1214/08-AAP532
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/222406
dc.subjectProbability
dc.subjectData Structures and Algorithms
dc.subject15A60, 60J10, 68W20, 68W40, 82B20 (Primary)
dc.titleMatrix norms and rapid mixing for spin systems
dc.typetext

Files

Collections

arXiv