Efficient algorithms for the Potts model on small-set expanders
From MaRDI portal
Publication:6538425
DOI10.4086/CJTCS.2024.001MaRDI QIDQ6538425
Ewan Davies, [[Person:6083600|Author name not available (Why is that?)]], Alexandra Kolla
Publication date: 14 May 2024
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cluster expansion for abstract polymer models
- The relative complexity of approximate counting problems
- The random-cluster model on the complete graph
- Algorithmic Pirogov-Sinai theory
- Faster mixing via average conductance
- How to Play Unique Games on Expanders
- Subexponential Algorithms for Unique Games and Related Problems
- Algorithms for #BIS-Hard Problems on Expander Graphs
- A proof of Alon’s second eigenvalue conjecture and related problems
- On the power of unique 2-prover 1-round games
- Approximating the Partition Function of the Ferromagnetic Potts Model
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- Fast Algorithms for General Spin Systems on Bipartite Expanders
- Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
- Improved analysis of higher order random walks and applications
- Algorithmic Pirogov-Sinai theory
- Partitioning into Expanders
- Multi-way spectral partitioning and higher-order cheeger inequalities
- Improved Cheeger's inequality
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Fast algorithms at low temperatures via Markov chains†
- Approximately counting independent sets in bipartite graphs via graph containers
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
Related Items (1)
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)
