2020
DOI: 10.48550/arxiv.2007.06931
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Entropy decay in the Swendsen-Wang dynamics on ${\mathbb Z}^d$

Antonio Blanca,
Pietro Caputo,
Daniel Parisi
et al.

Abstract: We study the mixing time of the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models on the integer lattice Z d . This dynamics is a widely used Markov chain that has largely resisted sharp analysis because it is non-local, i.e., it changes the entire configuration in one step. We prove that, whenever strong spatial mixing (SSM) holds, the mixing time on any n-vertex cube of Z d is O(log n), improving on the previous best known bound of O(n). SSM is a standard condition corresponding to exponent… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 41 publications
(82 reference statements)
0
3
0
Order By: Relevance
“…Our main result proves that, if we initialize the dynamics on the torus in the `1 `1 `1 or ´1 ´1 ´1 configurations with probability 1 2 each (denoted by ν ˘), then the mixing time is very fast (in fact optimal). 1 Theorem 1.1.…”
Section: Introductionmentioning
confidence: 68%
See 2 more Smart Citations
“…Our main result proves that, if we initialize the dynamics on the torus in the `1 `1 `1 or ´1 ´1 ´1 configurations with probability 1 2 each (denoted by ν ˘), then the mixing time is very fast (in fact optimal). 1 Theorem 1.1.…”
Section: Introductionmentioning
confidence: 68%
“…By virtue of a comparison technique introduced in [41], the above bounds on the random-cluster dynamics translate to bounds on the Swendsen-Wang dynamics up to a multiplicative factor of N . In special settings, one can do better than this lossy comparison and obtain optimal bounds: at low temperatures this includes the complete graph [4,17,28], Z 2 [1,32] and trees [2].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation