DeepAI AI Chat
Log In Sign Up

Beyond Windability: An FPRAS for The Six-Vertex Model

by   Zhiguo Fu, et al.
Northeast Normal University

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].


Approximability of the Four-Vertex Model

We study the approximability of the four-vertex model, a special case of...

Random Tilings with the GPU

We present GPU accelerated implementations of Markov chain algorithms to...

FPRAS Approximation of the Matrix Permanent in Practice

The matrix permanent belongs to the complexity class #P-Complete. It is ...

On Counting Perfect Matchings in General Graphs

Counting perfect matchings has played a central role in the theory of co...

Approximability of the Eight-vertex Model

We initiate a study of the classification of approximation complexity of...

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

Suppose that one particular block in a stochastic block model is deemed ...

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...