Beyond windability: approximability of the four-vertex model

DOI10.1016/j.tcs.2024.114491OpenAlexW4392520315MaRDI QIDQ6204549

Tianyu Liu, Xiongxin Yang

Publication date: 28 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114491

zbMATH Keywords

MCMCapproximate countingfour-vertex modelwindability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The worm process for the Ising model is rapidly mixing
• Four-vertex model and random tilings
• Random generation of combinatorial structures from a uniform distribution
• On the evaluation at (3,3) of the Tutte polynomial of a graph
• Complexity classification of the six-vertex model
• On the number of Eulerian orientations of a graph
• Partition function of the eight-vertex lattice model
• Markov Chain Algorithms for Planar Lattice Structures
• The statistics of dimers on a lattice
• Integrable models and combinatorics
• Computational Complexity of Holant Problems
• Polynomial-Time Approximation Algorithms for the Ising Model
• Canonical Paths for MCMC: from Art to Science
• Random cluster dynamics for the Ising model is rapidly mixing
• Approximately Sampling Elements with Fixed Rank in Graded Posets
• Approximability of the Six-vertex Model
• Dimer problem in statistical mechanics-an exact result
• Euler and bipartite matroids
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Beyond windability: approximability of the four-vertex model