The critical mean-field Chayes–Machta dynamics
From MaRDI portal
Publication:5886348
Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Monte Carlo methods applied to problems in statistical mechanics (82M31)
Recommendations
Cites work
- A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
- Continuity of the phase transition for planar random-cluster and Potts models with \({1 \leq q \leq 4}\)
- Cycles in a random graph near the critical point
- Discontinuity of the phase transition for the planar random-cluster and Potts models with \(q>4\)
- Dynamics for the mean-field random-cluster model
- Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
- High-dimensional probability. An introduction with applications in data science
- Local Limit Theorems for Lattice Random Variables
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On tree census and the giant component in sparse random graphs
- Probability. Theory and examples.
- Quasi-polynomial mixing of critical two-dimensional random cluster models
- Random cluster dynamics for the Ising model is rapidly mixing
- Random-cluster dynamics in \(\mathbb {Z}^2\)
- Random-cluster dynamics in \(\mathbb{Z}^2\)
- Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
- Random-cluster dynamics on random regular graphs in tree uniqueness
- Swendsen-Wang algorithm on the mean-field Potts model
- Swendsen-Wang is faster than single-bond dynamics
- The Accuracy of the Gaussian Approximation to the Sum of Independent Variates
- The Random-Cluster Model
- The Structure of a Random Graph at the Point of the Phase Transition
- The phase transition in the cluster‐scaled model of a random graph
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The random-cluster model on the complete graph
- The self-dual point of the two-dimensional random-cluster model is critical for \(q \geqslant 1\)
Cited in
(5)- Dynamic critical behavior of the Chayes-Machta algorithm for the random-cluster model. I: Two dimensions
- Dynamics for the mean-field random-cluster model
- Metastability of the Potts ferromagnet on random regular graphs
- The Critical Mean-field Chayes-Machta Dynamics
- Critical dynamics: a field-theoretical approach
This page was built for publication: The critical mean-field Chayes–Machta dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886348)