No. Title Author Year
1 Approximating Observables Is as Hard as Counting Galanis, Andreas et al. 2022
2 Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs Bezáková, Ivona et al. 2022
3 Metastability of the Potts Ferromagnet on Random Regular Graphs Coja-Oghlan, Amin et al. 2022
4 The Swendsen-Wang Dynamics on Trees Blanca, Antonio et al. 2021
5 Improved Strong Spatial Mixing for Colorings on Trees Efthymiou, Charilaos et al. 2019
6 The Complexity of Approximating the Matching Polynomial in the Complex Plane Bezáková, Ivona et al. 2019
7 Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs Blanca, Antonio et al. 2018
8 Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences Acharyya, Rupam et al. 2017
9 Inapproximability of the Independent Set Polynomial Below the Shearer Threshold Galanis, Andreas et al. 2017
10 Approximation via Correlation Decay When Strong Spatial Mixing Fails Bezáková, Ivona et al. 2016
11 Swendsen-Wang Algorithm on the Mean-Field Potts Model Galanis, Andreas et al. 2015
12 #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region Cai, Jin-Yi et al. 2014
13 Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results Galanis, Andreas et al. 2014
14 A graph polynomial for independent sets of bipartite graphs Ge, Qi et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 14

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI