Related papers: The computational hardness of counting in two-spin…
Computing the partition function, $Z$, of an Ising model over a graph of $N$ \enquote{spins} is most likely exponential in $N$. Efficient variational methods, such as Belief Propagation (BP) and Tree Re-Weighted (TRW) algorithms, compute…
We extend the study of the occupancy fraction of the hard-core model in two novel directions. One direction gives a tight lower bound in terms of individual vertex degrees, extending work of Sah, Sawhney, Stoner and Zhao which bounds the…
The s=3/2 Ising spin chain with uniform nearest-neighbor coupling, quadratic single-site potential, and magnetic field is shown to be equivalent to a system of 17 species of particles with internal structure. The same set of particles (with…
Autoregressive Neural Networks based on dense or convolutional layers have recently been shown to be a viable strategy for generating classical spin systems. Unlike these methods, sampling with transformers is commonly considered to be…
A common disadvantage in existing distribution-free two-sample testing approaches is that the computational complexity could be high. Specifically, if the sample size is $N$, the computational complexity of those two-sample tests is at…
In this paper we present a new solution of the star-triangle relation having positive Boltzmann weights. The solution defines an exactly solvable two-dimensional Ising-type (edge interaction) model of statistical mechanics where the local…
The maximum independent set problem is a classic optimization problem that has also been studied quite intensively in the distributed setting. While the problem is hard to approximate in general, there are good approximation algorithms…
The exact 2-spinon part of the dynamic spin structure factor $S_{xx}(Q,\omega)$ for the one-dimensional $s$=1/2 $XXZ$ model at $T$=0 in the antiferromagnetically ordered phase is calculated using recent advances by Jimbo and Miwa in the…
We examined energy spectrums of some particular systems of binary spins. It is shown that the configuration space can be divided into classes, and in the limit the energy distributions in these classes can be approximated by the normal…
We give algorithms for approximating the partition function of the ferromagnetic $q$-color Potts model on graphs of maximum degree $d$. Our primary contribution is a fully polynomial-time approximation scheme for $d$-regular graphs with an…
The hard-sphere model is one of the most extensively studied models in statistical physics. It describes the continuous distribution of spherical particles, governed by hard-core interactions. An important quantity of this model is the…
We introduce a problem class we call Polynomial Constraint Satisfaction Problems, or PCSP. Where the usual CSPs from computer science and optimization have real-valued score functions, and partition functions from physics have monomials,…
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph.…
In the work, we study the averaged number of massive fermions above a low rapidity threshold $Y$, underlying the form-factor expansions of the spin-spin two-point correlators at an Euclidean distance $r$, in the 2D Ising QFT at the free…
Deep inelastic structure functions have been calculated by Polchinski and Strassler in gauge/string duality introducing a hard infrared (IR) cut off in AdS space. Here we investigate this problem using a soft IR cut off that leads to linear…
The problem of N interacting spins on a lattice is equivalent to one of N clusters linked in a specific manner. The energy of any configuration of spins can be expressed in terms of the energy levels of this cluster. A new expression is…
We consider the task of learning Ising models when the signs of different random variables are flipped independently with possibly unequal, unknown probabilities. In this paper, we focus on the problem of robust estimation of…
We suggest a generalization of the Feynman path integral to an integral over random surfaces. The proposed action is proportional to the linear size of the random surfaces and is called gonihedric. The convergence and the properties of the…
This is the second paper devoted to energetic rigidity, in which we apply our formalism to examples in two dimensions: underconstrained random regular spring networks, vertex models, and jammed packings of soft particles. Spring networks…
Using the example of the two-dimensional (2D) Ising model, we show that in contrast to what can be done in configuration space, the tensor renormalization group (TRG) formulation allows one to write exact, compact, and manifestly local…