Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics
From MaRDI portal
Publication:6180362
DOI10.1214/23-aap1939zbMath1530.05168arXiv2107.10246OpenAlexW3186061378MaRDI QIDQ6180362
Reza Gheissari, Antonio Blanca
Publication date: 19 January 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.10246
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Time-dependent percolation in statistical mechanics (82C43)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Can extra updates delay mixing?
- Gibbs measures and phase transitions.
- Book review of: D. A. Levin et al., Markov chains and mixing times. 2nd edition
- Glauber dynamics for the mean-field Potts model
- Matrix norms and rapid mixing for spin systems
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The random cluster model on a general graph and a phase transition characterization of nonamenability
- The Ising model and percolation on trees and tree-like graphs
- The random-cluster model on a homogeneous tree
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Random-cluster dynamics on random regular graphs in tree uniqueness
- Finitary codings for the random-cluster model and other infinite-range monotone models
- Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
- Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
- Random-cluster dynamics in \(\mathbb {Z}^2\)
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
- The replica symmetric solution for Potts models on \(d\)-regular graphs
- Logarithmic Sobolev inequalities for finite Markov chains
- Fast mixing via polymers for random graphs with unbounded degree
- A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics
- Introduction to Random Graphs
- Rapid mixing of Gibbs sampling on graphs that are sparse on average
- Learning, Local Interaction, and Coordination
- Near-optimal fully-dynamic graph connectivity
- Mixing of the Glauber dynamics for the ferromagnetic Potts model
- The Probability That a Random Multigraph is Simple
- Random cluster dynamics for the Ising model is rapidly mixing
- Mixing Times of Critical Two‐Dimensional Potts Models
- Swendsen--Wang Is Faster than Single-Bond Dynamics
- Quasi‐polynomial mixing of critical two‐dimensional random cluster models
- Information percolation and cutoff for the random‐cluster model
- Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
- Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Poisson Cloning Model for Random Graphs
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Dobrushin Conditions and Systematic Scan
- The Swendsen-Wang Dynamics on Trees
This page was built for publication: Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics
