Algorithms for the ferromagnetic Potts model on expanders

Trees (05C05) Statistical mechanics of polymers (82D60) Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Approximation algorithms (68W25) Statistical mechanics of magnetic materials (82D40)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Counting in two-spin models on \(d\)-regular graphs
Combinatorics and complexity of partition functions
A reverse Sidorenko inequality
Cluster expansion for abstract polymer models
On the number of graphs without 4-cycles
The relative complexity of approximate counting problems
The random-cluster model on a homogeneous tree
Random-cluster dynamics on random regular graphs in tree uniqueness
On replica symmetry of large deviations in random graphs
Algorithms for #BIS-Hard Problems on Expander Graphs
Mixing of the Glauber dynamics for the ferromagnetic Potts model
Approximating the Partition Function of the Ferromagnetic Potts Model
The Asymptotic Number of Lattices
Fast Algorithms for General Spin Systems on Bipartite Expanders
Optimal Bounds for the k -cut Problem
Independent sets in the hypercube revisited
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
Algorithmic Pirogov-Sinai theory
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
Fast algorithms at low temperatures via Markov chains†
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
Efficient algorithms for the Potts model on small-set expanders
Metastability of the Potts ferromagnet on random regular graphs
Approximately counting independent sets in bipartite graphs via graph containers
Fast and perfect sampling of subgraphs and polymer systems

This page was built for publication: Algorithms for the ferromagnetic Potts model on expanders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632817)