vix.ing · top · new · best · stats · spec

Galanis, Andreas

  1. Approximation via Correlation Decay when Strong Spatial Mixing Fails
    2015/10/30 by Bezakova, Ivona, Galanis, Andreas, Goldberg, Leslie Ann +2 · 3 citations
    #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  2. Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region
    2013/05/13 by Galanis, Andreas, Stefankovic, Daniel, Vigoda, Eric · 2 citations
    #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Probability (math.PR)
  3. Swendsen-Wang Algorithm on the Mean-Field Potts Model
    2015/02/23 by Galanis, Andreas, Stefankovic, Daniel, Vigoda, Eric · 2 citations
    #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Probability (math.PR) #Statistical Mechanics (cond-mat.stat-mech)
  4. Amplifiers for the Moran Process
    2015/12/17 by Galanis, Andreas, Göbel, Andreas, Goldberg, Leslie Ann +2 · 2 citations
    #Discrete Mathematics (cs.DM) #FOS: Biological sciences #FOS: Computer and information sciences #FOS: Mathematics #Populations and Evolution (q-bio.PE) #Probability (math.PR) #Social and Information Networks (cs.SI)
  5. Learning Hard-Constrained Models with One Sample
    2023/11/06 by Galanis, Andreas, Kalavasis, Alkis, Kandiros, Anthimos Vardis · 4 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Statistics Theory (math.ST)
  6. Inapproximability of the independent set polynomial in the complex plane
    2017/11/01 by Bezakova, Ivona, Galanis, Andreas, Goldberg, Leslie Ann +1 · 2 citations
    #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  7. The complexity of approximating the complex-valued Ising model on bounded degree graphs
    2021/05/01 by Galanis, Andreas, Goldberg, Leslie Ann, Herrera-Poyatos, Andrés · 2 citations
    #68R05 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2
  8. Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
    2013/11/19 by Galanis, Andreas, Stefankovic, Daniel, Vigoda, Eric +1 · 1 citation
    #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Probability (math.PR)
  9. The complexity of approximating the matching polynomial in the complex plane
    2018/07/13 by Bezakova, Ivona, Galanis, Andreas, Goldberg, Leslie Ann +1 · 1 citation
    #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  10. Counting solutions to random CNF formulas
    2019/11/16 by Galanis, Andreas, Goldberg, Leslie Ann, Guo, Heng +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  11. The complexity of approximating the complex-valued Potts model
    2020/05/03 by Andreas Galanis, Leslie Ann Goldberg, Galanis, Andreas +3 · 1 citation
    Mathematics · #Markov Chains and Monte Carlo Methods #Random Matrices and Applications #Advanced Combinatorial Mathematics
  12. Rapid Mixing for Colorings via Spectral Independence
    2020/07/16 by Zongchen Chen, Chen, Zongchen, Andreas Galanis +5 · 1 citation
    Mathematics · #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Markov Chains and Monte Carlo Methods #Mathematical Physics (math-ph) #Probability (math.PR) #Random Matrices and Applications #Stochastic processes and statistical mechanics
  13. On Sampling from Ising Models with Spectral Constraints
    2024/07/10 by Galanis, Andreas, Kalavasis, Alkis, Kandiros, Anthimos Vardis · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)
  14. Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
    2020/06/26 by Buys, Pjotr, Galanis, Andreas, Patel, Viresh +1 · 1 citation
    #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics