Andreas Galanis
University of Oxford
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Andreas Galanis.
Combinatorics, Probability & Computing | 2016
Andreas Galanis; Daniel Stefankovic; Eric Vigoda
Recent inapproximability results of Sly ( 2010 ), together with an approximation algorithm presented by Weitz ( 2006 ), establish a beautiful picture of the computational complexity of approximating the partition function of the hard-core model. Let λ c (
symposium on the theory of computing | 2014
Andreas Galanis; Daniel Stefankovic; Eric Vigoda
\mathbb{T}_{\Delta}
Random Structures and Algorithms | 2014
Andreas Galanis; Qi Ge; Daniel Stefankovic; Eric Vigoda; Linji Yang
) denote the critical activity for the hard-model on the infinite Δ-regular tree. Weitz presented an FPTAS for the partition function when λ c (
international colloquium on automata, languages and programming | 2017
Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic
\mathbb{T}_{\Delta}
Random Structures and Algorithms | 2018
Andreas Galanis; Daniel Stefankovic; Eric Vigoda
) for graphs with constant maximum degree Δ. In contrast, Sly showed that for all Δ ⩾ 3, there exists e Δ > 0 such that (unless RP = NP) there is no FPRAS for approximating the partition function on graphs of maximum degree Δ for activities λ satisfying λ c (
Information & Computation | 2016
Andreas Galanis; Leslie Ann Goldberg
\mathbb{T}_{\Delta}
SIAM Journal on Computing | 2016
Andreas Galanis; Daniel Stefankovic; Eric Vigoda; Linji Yang
) c (
symposium on the theory of computing | 2018
Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic
\mathbb{T}_{\Delta}
SIAM Journal on Computing | 2016
Andreas Galanis; Leslie Ann Goldberg; Mark Jerrum
) + e Δ . We prove that a similar phenomenon holds for the antiferromagnetic Ising model. Sinclair, Srivastava and Thurley ( 2014 ) extended Weitzs approach to the antiferromagnetic Ising model, yielding an FPTAS for the partition function for all graphs of constant maximum degree Δ when the parameters of the model lie in the uniqueness region of the infinite Δ-regular tree. We prove the complementary result for the antiferromagnetic Ising model without external field, namely, that unless RP = NP, for all Δ ⩾ 3, there is no FPRAS for approximating the partition function on graphs of maximum degree Δ when the inverse temperature lies in the non-uniqueness region of the infinite tree
international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques | 2015
Andreas Galanis; Daniel Stefankovic; Eric Vigoda
\mathbb{T}_{\Delta}