中文

Matrix norms and rapid mixing for spin systems

概率论 2009-03-06 v3 数据结构与算法

摘要

We 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 0\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.

关键词

引用

@article{arxiv.math/0702744,
  title  = {Matrix norms and rapid mixing for spin systems},
  author = {Martin Dyer and Leslie Ann Goldberg and Mark Jerrum},
  journal= {arXiv preprint arXiv:math/0702744},
  year   = {2009}
}

备注

Published 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)