Related papers: Approximability of the Six-vertex Model

We initiate a study of the classification of approximation complexity of the eight-vertex model defined over 4-regular graphs. The eight-vertex model, together with its special case the six-vertex model, is one of the most extensively…

We consider a class of probability distributions on the six-vertex model, which originate from the higher spin vertex models in arXiv:1601.05770 and have previously been investigated in arXiv:1610.06893. For these random six-vertex models…

We present numerical results for the six-vertex model with a variety of boundary conditions. Adapting an algorithm proposed by Allison and Reshetikhin for domain wall boundary conditions, we examine some modifications of these boundary…

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…

We survey the connections between the six-vertex (square ice) model of 2d statistical mechanics and random matrix theory. We highlight the same universal probability distributions appearing on both sides, and also indicate related open…

In this letter, the 6-vertex model on dynamical random lattices is defined via a matrix model and rewritten (following I. Kostov) as a deformation of the O(2) model. In the large N planar limit, an exact solution is found at criticality.…

We use the Bethe-Peierls method combined with the belief propagation algorithm to study the arctic curves in the six vertex model on a square lattice with domain-wall boundary conditions, and the six vertex model on a rectangular lattice…

An accurate assessment of a model's complexity is crucial for topics such as interpretation, generalization, and model selection. However, most existing complexity measures either rely on heuristic assumptions or are computationally…

We discuss the influence of boundary conditions on the continuum limit of the six-vertex model by deriving a variational principle for the associated height function with arbitrary fixed boundary conditions. We discuss its consequences…

This is an overview of various aspects of the 6-vertex model in statistical mechanics and related models.

We study the asymmetric six-vertex model in the quadrant with parameters on the stochastic line. We show that the random height function of the model converges to an explicit deterministic limit shape as the mesh size tends to 0. We further…

We study the approximation complexity of the partition function of the eight-vertex model on general 4-regular graphs. For the first time, we relate the approximability of the eight-vertex model to the complexity of approximately counting…

This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…

The issue of the number, nature and sequence of phase transitions in the fully frustrated XY (FFXY) model is a highly non trivial one due to the complex interplay between its continuous and discrete degrees of freedom. In this contribution…

We study the integrability of the quantized six-vertex model with four parameters on a torus. It is a three-dimensional integrable lattice model in which a layer transfer matrix, depending on two spectral parameters associated with the…

The vertex-cover problem is studied for random graphs $G_{N,cN}$ having $N$ vertices and $cN$ edges. Exact numerical results are obtained by a branch-and-bound algorithm. It is found that a transition in the coverability at a $c$-dependent…

For the stochastic six-vertex model on the quadrant $\mathbb{Z}_{\geq0}\times\mathbb{Z}_{\geq0}$ with step initial conditions and a single second-class particle at the origin, we show almost sure convergence of the speed of the second-class…

We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then…

Our general subject is the emergence of phases, and phase transitions, in large networks subjected to a few variable constraints. Our main result is the analysis, in the model using edge and triangle subdensities for constraints, of a sharp…

We propose a simple geometric recipe for constructing phase diagrams for a general class of vertex models obeying the ice rule. The disordered phase maps onto the intersecting loop model which is interesting in its own right and is related…