Beyond Windability: An FPRAS for The Six-Vertex Model

02/07/2022
by   Zhiguo Fu, et al.
0

The six-vertex model is an important model in statistical physics and has deep connections with counting problems. There have been some fully polynomial randomized approximation schemes (FPRAS) for the six-vertex model [30, 10], which all require that the constraint functions are windable. In the present paper, we give an FPRAS for the six-vertex model with an unwindable constraint function by Markov Chain Monte Carlo method (MCMC). Different from [10], we use the Glauber dynamics to design the Markov Chain depending on a circuit decomposition of the underlying graph. Moreover, we prove the rapid mixing of the Markov Chain by coupling, instead of canonical paths in [10].

READ FULL TEXT
research
02/22/2023

Approximability of the Four-Vertex Model

We study the approximability of the four-vertex model, a special case of...
research
04/18/2018

Random Tilings with the GPU

We present GPU accelerated implementations of Markov chain algorithms to...
research
12/06/2020

FPRAS Approximation of the Matrix Permanent in Practice

The matrix permanent belongs to the complexity class #P-Complete. It is ...
research
12/20/2017

On Counting Perfect Matchings in General Graphs

Counting perfect matchings has played a central role in the theory of co...
research
11/07/2018

Approximability of the Eight-vertex Model

We initiate a study of the classification of approximation complexity of...
research
02/14/2018

Vertex nomination: The canonical sampling and the extended spectral nomination schemes

Suppose that one particular block in a stochastic block model is deemed ...
research
10/27/2017

Rapidly Mixing Markov Chain Monte Carlo Technique for Matching Problems with Global Utility Function

This paper deals with a complete bipartite matching problem with the obj...

Please sign up or login with your details

Forgot password? Click here to reset