Approximability of the Six-vertex Model

12/16/2017
by   Jin-Yi Cai, et al.
0

In this paper we take the first step toward a classification of the approximation complexity of the six-vertex model, an object of extensive research in statistical physics. Our complexity results conform to the phase transition phenomenon from physics. We show that the approximation complexity of the six-vertex model behaves dramatically differently on the two sides separated by the phase transition threshold. Furthermore, we present structural properties of the six-vertex model on planar graphs for parameter settings that have known relations to the Tutte polynomial T(G, x, y).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/07/2018

Approximability of the Eight-vertex Model

We initiate a study of the classification of approximation complexity of...
research
01/04/2020

Phase Transitions in the Edge/Concurrent Vertex Model

Although it is well-known that some exponential family random graph mode...
research
05/11/2023

Backdoor to the Hidden Ground State: Planted Vertex Cover Example

We introduce a planted vertex cover problem on regular random graphs and...
research
02/22/2023

Approximability of the Four-Vertex Model

We study the approximability of the four-vertex model, a special case of...
research
10/12/2020

FPRAS via MCMC where it mixes torpidly (and very little effort)

Is Fully Polynomial-time Randomized Approximation Scheme (FPRAS) for a p...
research
04/23/2019

Counting perfect matchings and the eight-vertex model

We study the approximation complexity of the partition function of the e...
research
03/29/2023

The Hidden-Manifold Hopfield Model and a learning phase transition

The Hopfield model has a long-standing tradition in statistical physics,...

Please sign up or login with your details

Forgot password? Click here to reset