Dobrushin Conditions for Systematic Scan with Block Dynamics

DOI10.1007/978-3-540-74456-6_25zbMATH Open1147.68523arXivmath/0703461OpenAlexW1494212239MaRDI QIDQ3525575FDOQ3525575

Authors: Kasper Selmar Pedersen 

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Abstract: We study the mixing time of systematic scan Markov chains on finite spin systems. It is known that, in a single site setting, the mixing time of systematic scan can be bounded in terms of the influences sites have on each other. We generalise this technique for bounding the mixing time of systematic scan to block dynamics, a setting in which a (constant size) set of sites are updated simultaneously. In particular we consider the parameter alpha, corresponding to the maximum influence on any site, and show that if alpha<1 then the corresponding systematic scan Markov chain mixes rapidly. As applications of this method we prove O(log n) mixing of systematic scan (for any scan order) for heat-bath updates of edges for proper q-colourings of a general graph with maximum vertex-degree Delta when q>=2Delta. We also apply the method to improve the number of colours required in order to obtain mixing in O(log n) scans for systematic scan for heat-bath updates on trees, using some suitable block updates.

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

Recommendations

• Dobrushin Conditions and Systematic Scan
• Dobrushin Conditions and Systematic Scan
• Systematic scan for sampling colorings
• On mixing of Markov chains: coupling, spectral independence, and entropy factorization
• On systematic scan for sampling \(H\)-colorings of the path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (7)

• Can extra updates delay mixing?
• Systematic scan for sampling colorings
• Dobrushin Conditions and Systematic Scan
• A SYSTEMATIC SCAN FOR 7-COLOURINGS OF THE GRID
• On systematic scan for sampling \(H\)-colorings of the path
• Dobrushin Conditions and Systematic Scan
• Sampling colourings of the triangular lattice

This page was built for publication: Dobrushin Conditions for Systematic Scan with Block Dynamics

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