We consider spin systems with nearest-neighbor interactions on an n-vertex d-dimensional cube of the integer lattice graph (Formula presented.). We study the effects that the strong spatial mixing condition (SSM) has on the rate of convergence to equilibrium of nonlocal Markov chains. We prove that when SSM holds, the relaxation time (i.e., the inverse spectral gap) of general block dynamics is O(r), where r is the number of blocks. As a second application of our technology, it is established that SSM implies an O(1) bound for the relaxation time of the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models. We also prove that for monotone spin systems SSM implies that the mixing time of systematic scan dynamics is (Formula presented.). Our proofs use a variety of techniques for the analysis of Markov chains including coupling, functional analysis and linear algebra.
Blanca, A., Caputo, P., Sinclair, A., Vigoda, E. (2019). Spatial mixing and nonlocal Markov chains. RANDOM STRUCTURES & ALGORITHMS, 55(3), 584-614 [10.1002/rsa.20844].
Spatial mixing and nonlocal Markov chains
Caputo P.;
2019-01-01
Abstract
We consider spin systems with nearest-neighbor interactions on an n-vertex d-dimensional cube of the integer lattice graph (Formula presented.). We study the effects that the strong spatial mixing condition (SSM) has on the rate of convergence to equilibrium of nonlocal Markov chains. We prove that when SSM holds, the relaxation time (i.e., the inverse spectral gap) of general block dynamics is O(r), where r is the number of blocks. As a second application of our technology, it is established that SSM implies an O(1) bound for the relaxation time of the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models. We also prove that for monotone spin systems SSM implies that the mixing time of systematic scan dynamics is (Formula presented.). Our proofs use a variety of techniques for the analysis of Markov chains including coupling, functional analysis and linear algebra.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.