Random-cluster dynamics on random regular graphs in tree uniqueness

DOI10.1007/s00220-021-04093-zzbMath1484.82007arXiv2008.02264OpenAlexW3177954806MaRDI QIDQ2046800

Reza Gheissari, Antonio Blanca

Publication date: 19 August 2021

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionPotts modelrandom graphrandom-cluster dynamics

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Phase transitions (general) in equilibrium statistical mechanics (82B26) Percolation (82B43) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (5)

The critical mean-field Chayes–Machta dynamics ⋮ Low-temperature Ising dynamics with random initializations ⋮ Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs ⋮ Metastability of the Potts ferromagnet on random regular graphs ⋮ Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Can extra updates delay mixing?
• Book review of: D. A. Levin et al., Markov chains and mixing times. 2nd edition
• Glauber dynamics for the mean-field Potts model
• Ising models on locally tree-like graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• For 2-D lattice spin systems weak mixing implies strong mixing
• On weak mixing in lattice models
• The random cluster model on a general graph and a phase transition characterization of nonamenability
• The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions
• Perfect sampling using bounding chains.
• The random-cluster model on a homogeneous tree
• The random-cluster model on the complete graph
• Exact thresholds for Ising-Gibbs samplers on general graphs
• Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
• Factor models on locally tree-like graphs
• The replica symmetric solution for Potts models on \(d\)-regular graphs
• Logarithmic Sobolev inequalities for finite Markov chains
• Comparison of Swendsen-Wang and heat-bath dynamics
• Introduction to Random Graphs
• Rapid mixing of Gibbs sampling on graphs that are sparse on average
• Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
• Near-optimal fully-dynamic graph connectivity
• Mixing of the Glauber dynamics for the ferromagnetic Potts model
• On colouring random graphs
• Random-Cluster Dynamics in ℤ²
• Fully Dynamic Connectivity in O(log n(log log n)²) Amortized Expected Time
• 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
• Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
• Swendsen‐Wang dynamics for general graphs in the tree uniqueness region
• Quasi‐polynomial mixing of critical two‐dimensional random cluster models
• Information percolation and cutoff for the random‐cluster model
• Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
• Dynamics for the mean-field random-cluster model
• Swendsen-Wang Algorithm on the Mean-Field Potts Model
• The phase transition in the cluster‐scaled model of a random graph
• Rapid mixing of Swendsen–Wang dynamics in two dimensions
• Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
• A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold

This page was built for publication: Random-cluster dynamics on random regular graphs in tree uniqueness