Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
From MaRDI portal
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Percolation (82B43) Statistical mechanics of magnetic materials (82D40)
Recommendations
- Sampling in Potts model on sparse random graphs
- Random-cluster dynamics on random regular graphs in tree uniqueness
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Ferromagnetic Potts model: refined \#BIS-hardness and related results
- On the Potts antiferromagnet on random graphs
Cites work
- A simple algorithm for random colouring G(n, d/n) using (2 + )d colours
- A Simple Algorithm for Sampling Colorings of G(n,d/n) Up to The Gibbs Uniqueness Threshold
- Algorithmic Pirogov-Sinai theory
- Algorithms for #BIS-hard problems on expander graphs
- 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
- Approximating partition functions of the two-state spin system
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
- Bound on the mass gap for finite volume stochastic Ising models at low temperature
- Counting independent sets up to the tree threshold
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- For 2-D lattice spin systems weak mixing implies strong mixing
- Glauber dynamics on trees and hyperbolic graphs
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1787232 (Why is no real title available?)
- Information, Physics, and Computation
- Introduction to Random Graphs
- Mixing of the Glauber dynamics for the ferromagnetic Potts model
- Mixing properties and exponential decay for lattice systems in finite volumes.
- On the hardness of sampling independent sets beyond the tree threshold
- Rapid mixing of Gibbs sampling on graphs that are sparse on average
- Sampling in Potts model on sparse random graphs
- Sampling random colorings of sparse random graphs
- Spatial mixing and the connective constant: optimal bounds
- The random cluster model on a general graph and a phase transition characterization of nonamenability
- The Random-Cluster Model
- The random-cluster model on a homogeneous tree
- The replica symmetric solution for Potts models on d-regular graphs
- The self-dual point of the two-dimensional random-cluster model is critical for q 1
- Uniqueness for the 3-state antiferromagnetic Potts model on the tree
- Uniqueness of uniform random colorings of regular trees
Cited in
(22)- Uniqueness for the 3-state antiferromagnetic Potts model on the tree
- Random-cluster dynamics on random regular graphs in tree uniqueness
- Fast mixing via polymers for random graphs with unbounded degree
- Random cluster model on regular graphs
- Algorithms for \#BIS-hard problems on expander graphs
- Sampling in Potts model on sparse random graphs
- G method in action: normalization constant, important probabilities, and fast exact sampling for Potts model on trees
- Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
- Counting solutions to random CNF formulas
- Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree
- Δ-wavy probability distributions and Potts model
- The Swendsen–Wang dynamics on trees
- Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite -regular tree for large
- 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
- Algorithms for the ferromagnetic Potts model on expanders
- Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
- Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
- Fast sampling via spectral independence beyond bounded-degree graphs
- On the Potts antiferromagnet on random graphs
- Low-temperature sampling on sparse random graphs
This page was built for publication: Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220472)
