A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs

01/20/2019
by   Andreas Galanis, et al.
0

Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs. Their method is based on Pirogov-Sinai theory -- using cluster expansion to obtain a zero-free region for a so-called polymer partition function in the complex plane, and then approximating the polymer partition function using methods of Barvinok and Patel and Regts. In this note, we circumvent the zero-free analysis and the generalisation to complex fugacities, showing that the polymer partition function can be approximated using Glauber dynamics. The proof that Glauber dynamics mixes rapidly is easy and is based on using the sizes of the disagreeing polymers as a distance function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/20/2019

Markov chains for the hard-core model via polymer models

Jenssen, Keevash and Perkins give an FPTAS and an efficient sampling alg...
research
06/04/2019

Counting independent sets in unbalanced bipartite graphs

We give an FPTAS for approximating the partition function of the hard-co...
research
08/09/2018

A note on partial rejection sampling for the hard disks model in the plane

In this note, we slightly improve the guarantees obtained by Guo and Jer...
research
04/05/2022

Algorithms for the ferromagnetic Potts model on expanders

We give algorithms for approximating the partition function of the ferro...
research
01/04/2022

The cluster structure function

For each partition of a data set into a given number of parts there is a...
research
05/01/2021

The complexity of approximating the complex-valued Ising model on bounded degree graphs

We study the complexity of approximating the partition function Z_Ising(...
research
11/08/2021

Absence of zeros implies strong spatial mixing

In this paper we show that absence of complex zeros of the partition fun...

Please sign up or login with your details

Forgot password? Click here to reset