Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
From MaRDI portal
Publication:5009528
Recommendations
- Sampling in uniqueness from the Potts and random-cluster models on random regular graphs
- Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- Sampling in Potts model on sparse 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
- 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
- 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
- scientific article; zbMATH DE number 1787232 (Why is no real title available?)
- scientific article; zbMATH DE number 934434 (Why is no real title available?)
- Information, Physics, and Computation
- 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 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
(5)- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics
- Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
- A spectral approach to approximately counting independent sets in dense bipartite graphs
- On the tractability of sampling from the Potts model at low temperatures via random-cluster dynamics
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 Q5009528)
