Swendsen‐Wang algorithm on the mean‐field Potts model
Publication:4625031
DOI10.1002/rsa.20768zbMath1412.82009OpenAlexW2963301778MaRDI QIDQ4625031
Eric Vigoda, Daniel Štefanković, Andreas Galanis
Publication date: 20 February 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20768
Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Graph algorithms (graph-theoretic aspects) (05C85) Statistical mechanics of magnetic materials (82D40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical Ising on the square lattice mixes in polynomial time
- Glauber dynamics for the mean-field Potts model
- The self-dual point of the two-dimensional random-cluster model is critical for \(q \geqslant 1\)
- The critical random graph, with martingales
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Approach to equilibrium of Glauber dynamics in the one phase region. II: The general case
- The random-cluster model on the complete graph
- The Swendsen-Wang process does not always mix rapidly
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
- Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids
- A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics
- Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
- Complete analysis of phase transitions and ensemble equivalence for the Curie–Weiss–Potts model
- Random cluster dynamics for the Ising model is rapidly mixing
- Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
- Mixing Times of Critical Two‐Dimensional Potts Models
- Swendsen--Wang Is Faster than Single-Bond Dynamics
- Dynamics for the mean-field random-cluster model
- Counting connected graphs and hypergraphs via the probabilistic method
- Rapid mixing of Swendsen–Wang dynamics in two dimensions
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$