English
Related papers

Related papers: Approximability of the Six-vertex Model

200 papers

This letter is concerned with the analysis of the six-vertex model with domain-wall boundaries in terms of partial differential equations (PDEs). The model's partition function is shown to obey a system of PDEs resembling the celebrated…

Mathematical Physics · Physics 2016-04-20 W. Galleas

We consider the six-vertex model with domain wall boundary conditions. We choose the inhomogeneities as solutions of the Bethe Ansatz equations. The Bethe Ansatz equations have many solutions, so we can consider a wide variety of…

Mathematical Physics · Physics 2009-11-07 J. de Gier , V. Korepin

In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…

Disordered Systems and Neural Networks · Physics 2009-10-31 Martin Weigt , Alexander K. Hartmann

Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…

Social and Information Networks · Computer Science 2013-05-28 Charalampos E. Tsourakakis

In this paper we consider a class of probability distributions on the six-vertex model from statistical mechanics, which originate from the higher spin vertex models of https://arxiv.org/abs/1601.05770. We define operators, inspired by the…

Probability · Mathematics 2017-03-01 Evgeni Dimitrov

Proof of existence of a complex structure on the six-sphere, followed by an explicit computation of its underlying integrable almost complex tensor by the aid of inner automorphisms of the octonions, is exhibited. Both are elementary and…

Differential Geometry · Mathematics 2024-10-08 Gabor Etesi

For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…

Algebraic Topology · Mathematics 2017-10-18 Robert Short

This paper gives a way to simulate from the two star probability distribution on the space of simple graphs via auxiliary variables. Using this simulation scheme, the model is explored for various domains of the parameter values, and the…

Statistics Theory · Mathematics 2013-10-16 Sumit Mukherjee

Based on numerical simulation and local stability analysis we describe the structure of the phase space of the edge/triangle model of random graphs. We support simulation evidence with mathematical proof of continuity and discontinuity for…

Combinatorics · Mathematics 2017-10-25 Richard Kenyon , Charles Radin , Kui Ren , Lorenzo Sadun

We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be…

Numerical Analysis · Mathematics 2023-01-26 Peter Binev , Francesca Fierro , Andreas Veeser

We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…

Probability · Mathematics 2012-03-27 Svante Janson , Oliver Riordan

It is demonstrated in the context of the simple one-dimensional example of a barrier in an infinite well, that highly complex behavior of the time evolution of a wave function is associated with the almost degeneracy of levels in the…

Condensed Matter · Physics 2008-12-18 L. P. Horwitz , J. Levitan , Y. Ashkenazy

We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \#P-hard. The dichotomy criterion…

Computational Complexity · Computer Science 2017-03-31 Jin-Yi Cai , Zhiguo Fu

We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…

Machine Learning · Computer Science 2020-03-10 Pritish Kamath , Omar Montasser , Nathan Srebro

The Tutte polynomial of a graph G is a two-variable polynomial T(G;x,y) that encodes many interesting properties of the graph. We study the complexity of the following problem, for rationals x and y: given as input a planar graph G,…

Computational Complexity · Computer Science 2012-10-03 Leslie Ann Goldberg , Mark Jerrum

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

Combinatorics · Mathematics 2020-04-07 Lochlan Brick , Pu Gao , Angus Southwell

The goal of this paper is to provide a short proof of the discontinuity of phase transition for the random-cluster model on the square lattice with parameter $q>4$. This result was recently shown via the so-called Bethe ansatz for the…

Probability · Mathematics 2020-10-28 Gourab Ray , Yinon Spinka

We obtain an asymptotic formula for the partition function of the six-vertex model with partial domain wall boundary conditions in the ferroelectric phase region. The proof is based on a formula for the partition function involving the…

Mathematical Physics · Physics 2015-02-23 Pavel Bleher , Karl Liechty

Vertical-arrow fluctuations near the boundaries in the six-vertex model on the two-dimensional $N \times N$ square lattice with the domain wall boundary conditions are considered. The one-point correlation function (`boundary polarization')…

Statistical Mechanics · Physics 2009-11-07 N. M. Bogoliubov , A. V. Kitaev , M. B. Zvonarev

Some features of integrable lattice models are reviewed for the case of the six-vertex model. By the Bethe ansatz method we derive the free energy of the six-vertex model. Then, from the expression of the free energy we show analytically…

Statistical Mechanics · Physics 2007-05-23 Tetsuo Deguchi