Can extra updates delay mixing?

From MaRDI portal
Publication:378052

DOI10.1007/S00220-013-1776-0zbMATH Open1277.82036arXiv1112.0603OpenAlexW2031651515MaRDI QIDQ378052FDOQ378052


Authors: Yuval Peres, Peter Winkler Edit this on Wikidata


Publication date: 11 November 2013

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: We consider Glauber dynamics (starting from an extremal configuration) in a monotone spin system, and show that interjecting extra updates cannot increase the expected Hamming distance or the total variation distance to the stationary distribution. We deduce that for monotone Markov random fields, when block dynamics contracts a Hamming metric, single-site dynamics mixes in O(n log n) steps on an n-vertex graph. In particular, our result completes work of Kenyon, Mossel and Peres concerning Glauber dynamics for the Ising model on trees. Our approach also shows that on bipartite graphs, alternating updates systematically between odd and even vertices cannot improve the mixing time by more than a factor of log n compared to updates at uniform random locations on an n-vertex graph. Our result is especially effective in comparing block and single-site dynamics; it has already been used in works of Martinelli, Sinclair, Mossel, Sly, Ding, Lubetzky, and Peres in various combinations.


Full work available at URL: https://arxiv.org/abs/1112.0603




Recommendations




Cites Work


Cited In (23)





This page was built for publication: Can extra updates delay mixing?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378052)