Abstract
We study the approximability of the four-vertex model, a special case of the six-vertex model. We prove that, despite being NP-hard to approximate in the worst case, the four-vertex model admits a fully polynomial randomized approximation scheme (FPRAS) when the input satisfies certain linear equation system over GF(2). The FPRAS is given by a Markov chain known as the worm process, whose state space and rapid mixing rely on the solution of the linear equation system. This is the first attempt to design an FPRAS for the six-vertex model with unwindable constraint functions. Additionally, we explore the applications of this technique on planar graphs, providing efficient sampling algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
