No. |
Title |
Author |
Year |
---|

1 |
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees |
Efthymiou, Charilaos et al. |
2023 |

2 |
Approximating Observables Is as Hard as Counting |
Galanis, Andreas et al. |
2022 |

3 |
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs |
Bezáková, Ivona et al. |
2022 |

4 |
Metastability of the Potts Ferromagnet on Random Regular Graphs |
Coja-Oghlan, Amin et al. |
2022 |

5 |
The Swendsen-Wang Dynamics on Trees |
Blanca, Antonio et al. |
2021 |

6 |
Improved Strong Spatial Mixing for Colorings on Trees |
Efthymiou, Charilaos et al. |
2019 |

7 |
The Complexity of Approximating the Matching Polynomial in the Complex Plane |
Bezáková, Ivona et al. |
2019 |

8 |
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs |
Blanca, Antonio et al. |
2018 |

9 |
Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences |
Acharyya, Rupam et al. |
2017 |

10 |
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold |
Galanis, Andreas et al. |
2017 |

11 |
Approximation via Correlation Decay When Strong Spatial Mixing Fails |
Bezáková, Ivona et al. |
2016 |

12 |
Swendsen-Wang Algorithm on the Mean-Field Potts Model |
Galanis, Andreas et al. |
2015 |

13 |
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region |
Cai, Jin-Yi et al. |
2014 |

14 |
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results |
Galanis, Andreas et al. |
2014 |

15 |
A graph polynomial for independent sets of bipartite graphs |
Ge, Qi et al. |
2010 |