A
Andreas Galanis
Researcher at University of Oxford
Publications - 82
Citations - 1065
Andreas Galanis is an academic researcher from University of Oxford. The author has contributed to research in topics: Degree (graph theory) & Bipartite graph. The author has an hindex of 17, co-authored 77 publications receiving 807 citations. Previous affiliations of Andreas Galanis include Georgia Institute of Technology.
Papers
More filters
Journal ArticleDOI
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
TL;DR: Weitz et al. as mentioned in this paper showed that unless RP = NP, there is no FPTAS for the partition function on graphs of maximum degree Δ when the inverse temperature lies in the non-uniqueness region of the infinite tree.
Journal ArticleDOI
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
TL;DR: Li et al. as mentioned in this paper showed that for the antiferrogmanetic Ising model without external field, unless RP=NP, there is no FPRAS for approximating the partition function on graphs of maximum degree when the inverse temperature lies in the non-uniqueness regime of the infinite tree.
Journal ArticleDOI
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
TL;DR: For bipartite graphs of maximum degree Δ, this article showed that approximating the partition function of the ferromagnetic Potts model is at least as hard as computing the number of independent sets.
Journal ArticleDOI
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
TL;DR: For k-colorings it is proved that for even k, in a tree nonuniqueness region (which corresponds to k < Δ) there is no FPRAS, unless NP = RP, to approximate the number of colorings for triangle-free Δ-regular graphs.
Posted Content
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
TL;DR: Sly's inapproximability result is extended by improving upon the technical work of Mossel et al., via a more detailed analysis of independent sets in random regular graphs, which proves torpid mixing of the Glauber dynamics for sampling from the associated Gibbs distribution on almost every regular graph of degree Δ.