A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics

DOI10.1090/memo/1092zbMath1304.60078arXiv1107.2970OpenAlexW4238020138MaRDI QIDQ2925658

Yuval Peres, Asaf Nachmias, Yun Long, Weiyang Ning

Publication date: 17 October 2014

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsIsing modelmixing timeSwendsen-Wang algorithm

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

The critical mean-field Chayes–Machta dynamics, Random-cluster dynamics in \(\mathbb {Z}^2\), Entropy decay in the Swendsen-Wang dynamics on \(\mathbb{Z}^d\), Random cluster dynamics for the Ising model is rapidly mixing, Exponentially slow mixing in the mean-field Swendsen-Wang dynamics, Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields, Low-temperature Ising dynamics with random initializations, Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics, Unnamed Item, Swendsen‐Wang algorithm on the mean‐field Potts model, The Ising partition function: zeros and deterministic approximation, The worm process for the Ising model is rapidly mixing, On the critical probability in percolation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic normality of the size of the giant component via a random walk
• Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
• The critical random graph, with martingales
• Dynamical critical behavior of the Swendson-Wang algorithm: The two-dimensional three-state Potts model revisited
• Dynamical critical behavior of a Swendsen-Wang-type algorithm for the Ashkin-Teller model
• Counting connected graphs inside-out
• An elementary proof of the local central limit theorem
• Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids
• Critical percolation on random regular graphs
• Polynomial-Time Approximation Algorithms for the Ising Model
• The transitive closure of a random digraph
• A Combinatorial Lemma and Its Application to Probability Theory
• Random Walk: A Modern Introduction
• The Evolution of Random Graphs
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• Component behavior near the critical point of the random graph process
• On tree census and the giant component in sparse random graphs