Efficient algorithms for the Potts model on small-set expanders
From MaRDI portal
(Redirected from Publication:6538425)
Recommendations
Cites work
- A proof of Alon’s second eigenvalue conjecture and related problems
- Algorithmic Pirogov-Sinai theory
- Algorithmic Pirogov-Sinai theory
- Algorithms for \#BIS-hard problems on expander graphs
- Approximately counting independent sets in bipartite graphs via graph containers
- Cluster expansion for abstract polymer models
- Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
- Fast algorithms at low temperatures via Markov chains†
- Fast algorithms for general spin systems on bipartite expanders
- Faster mixing via average conductance
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- How to Play Unique Games on Expanders
- scientific article; zbMATH DE number 7561741 (Why is no real title available?)
- scientific article; zbMATH DE number 5937160 (Why is no real title available?)
- Improved analysis of higher order random walks and applications
- Improved Cheeger's inequality, analysis of spectral partitioning algorithms through higher order spectral gap
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- On the power of unique 2-prover 1-round games
- Partitioning into expanders
- Subexponential algorithms for unique games and related problems
- The random-cluster model on the complete graph
- The relative complexity of approximate counting problems
Cited in
(2)
This page was built for publication: Efficient algorithms for the Potts model on small-set expanders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538425)
