### Abstract

We consider spin systems with nearest-neighbor interactions on an n-vertex d-dimensional cube of the integer lattice graph Zd. We study the effects that exponential decay with distance of spin correlations, specifically the strong spatial mixing condition (SSM), has on the rate of convergence to equilibrium of non-local Markov chains. We prove that SSM implies O(log n) mixing of a block dynamics whose steps can be implemented efficiently. We then develop a methodology, consisting of several new comparison inequalities concerning various block dynamics, that allow us to extend this result to other non-local dynamics. As a first application of our method we prove that, if SSM holds, then the relaxation time (i.e., the inverse spectral gap) of general block dynamics is O(r), where r is the number of blocks. A second application of our technology concerns the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models. We show that SSM implies an O(1) bound for the relaxation time. As a by-product of this implication we observe that the relaxation time of the Swendsen-Wang dynamics in square boxes of Z2 is O(1) throughout the subcritical regime of the q-state Potts model, for all q ≥ 2. We also prove that for monotone spin systems SSM implies that the mixing time of systematic scan dynamics is O(log n(log log n)2). Systematic scan dynamics are widely employed in practice but have proved hard to analyze. Our proofs use a variety of techniques for the analysis of Markov chains including coupling, functional analysis and linear algebra.

Original language | English (US) |
---|---|

Title of host publication | 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 |

Editors | Artur Czumaj |

Publisher | Association for Computing Machinery |

Pages | 1965-1980 |

Number of pages | 16 |

ISBN (Electronic) | 9781611975031 |

DOIs | |

State | Published - Jan 1 2018 |

Event | 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 - New Orleans, United States Duration: Jan 7 2018 → Jan 10 2018 |

### Publication series

Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|

### Conference

Conference | 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 |
---|---|

Country | United States |

City | New Orleans |

Period | 1/7/18 → 1/10/18 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Mathematics(all)

### Cite this

*29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018*(pp. 1965-1980). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.128

}

*29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018.*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, pp. 1965-1980, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, United States, 1/7/18. https://doi.org/10.1137/1.9781611975031.128

**Spatial mixing and non-local Markov chains.** / Pimentel, Antonio Blanca; Caputo, Pietro; Sinclair, Alistair; Vigoda, Eric.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Spatial mixing and non-local Markov chains

AU - Pimentel, Antonio Blanca

AU - Caputo, Pietro

AU - Sinclair, Alistair

AU - Vigoda, Eric

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We consider spin systems with nearest-neighbor interactions on an n-vertex d-dimensional cube of the integer lattice graph Zd. We study the effects that exponential decay with distance of spin correlations, specifically the strong spatial mixing condition (SSM), has on the rate of convergence to equilibrium of non-local Markov chains. We prove that SSM implies O(log n) mixing of a block dynamics whose steps can be implemented efficiently. We then develop a methodology, consisting of several new comparison inequalities concerning various block dynamics, that allow us to extend this result to other non-local dynamics. As a first application of our method we prove that, if SSM holds, then the relaxation time (i.e., the inverse spectral gap) of general block dynamics is O(r), where r is the number of blocks. A second application of our technology concerns the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models. We show that SSM implies an O(1) bound for the relaxation time. As a by-product of this implication we observe that the relaxation time of the Swendsen-Wang dynamics in square boxes of Z2 is O(1) throughout the subcritical regime of the q-state Potts model, for all q ≥ 2. We also prove that for monotone spin systems SSM implies that the mixing time of systematic scan dynamics is O(log n(log log n)2). Systematic scan dynamics are widely employed in practice but have proved hard to analyze. Our proofs use a variety of techniques for the analysis of Markov chains including coupling, functional analysis and linear algebra.

AB - We consider spin systems with nearest-neighbor interactions on an n-vertex d-dimensional cube of the integer lattice graph Zd. We study the effects that exponential decay with distance of spin correlations, specifically the strong spatial mixing condition (SSM), has on the rate of convergence to equilibrium of non-local Markov chains. We prove that SSM implies O(log n) mixing of a block dynamics whose steps can be implemented efficiently. We then develop a methodology, consisting of several new comparison inequalities concerning various block dynamics, that allow us to extend this result to other non-local dynamics. As a first application of our method we prove that, if SSM holds, then the relaxation time (i.e., the inverse spectral gap) of general block dynamics is O(r), where r is the number of blocks. A second application of our technology concerns the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models. We show that SSM implies an O(1) bound for the relaxation time. As a by-product of this implication we observe that the relaxation time of the Swendsen-Wang dynamics in square boxes of Z2 is O(1) throughout the subcritical regime of the q-state Potts model, for all q ≥ 2. We also prove that for monotone spin systems SSM implies that the mixing time of systematic scan dynamics is O(log n(log log n)2). Systematic scan dynamics are widely employed in practice but have proved hard to analyze. Our proofs use a variety of techniques for the analysis of Markov chains including coupling, functional analysis and linear algebra.

UR - http://www.scopus.com/inward/record.url?scp=85045563434&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85045563434&partnerID=8YFLogxK

U2 - 10.1137/1.9781611975031.128

DO - 10.1137/1.9781611975031.128

M3 - Conference contribution

AN - SCOPUS:85045563434

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 1965

EP - 1980

BT - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018

A2 - Czumaj, Artur

PB - Association for Computing Machinery

ER -