Related papers: The complexity of approximating the complex-valued…
We give a comprehensive study of bin packing with conflicts (BPC). The input is a set $I$ of items, sizes $s:I \rightarrow [0,1]$, and a conflict graph $G = (I,E)$. The goal is to find a partition of $I$ into a minimum number of independent…
We study the complexity of approximate counting Constraint Satisfaction Problems (#CSPs) in a bounded degree setting. Specifically, given a Boolean constraint language $\Gamma$ and a degree bound $\Delta$, we study the complexity of…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
The Correlation Clustering problem is one of the most extensively studied clustering formulations due to its wide applications in machine learning, data mining, computational biology and other areas. We consider the Correlation Clustering…
We study the critical properties of a two--dimensional Ising model with competing ferromagnetic exchange and dipolar interactions, which models an ultra-thin magnetic film with high out--of--plane anisotropy in the monolayer limit. In this…
This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several…
Consider Glauber dynamics for the Ising model on a graph of $n$ vertices. Hayes and Sinclair showed that the mixing time for this dynamics is at least $n\log n/f(\Delta)$, where $\Delta$ is the maximum degree and $f(\Delta) = \Theta(\Delta…
We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs…
We use the recently developed navigator method to obtain rigorous upper and lower bounds on new OPE data in the 3d Ising CFT. For example, assuming that there are only two $\mathbb{Z}_2$-even scalar operators $\epsilon$ and $\epsilon'$ with…
The fractal dimensions of polymer chains and high-temperature graphs in the Ising model both in three dimension are determined using the conformal bootstrap applied for the continuation of the $O(N)$ models from $N=1$ (Ising model) to $N=0$…
We study the statistical complexity of estimating partition functions given sample access to a proposal distribution and an unnormalized density ratio for a target distribution. While partition function estimation is a classical problem,…
We study the ferromagnetic Ising model on the infinite $d$-regular tree under the free boundary condition. This model is known to be a factor of IID in the uniqueness regime, when the inverse temperature $\beta\ge 0$ satisfies $\tanh \beta…
Recent results establish for 2-spin antiferromagnetic systems that the computational complexity of approximating the partition function on graphs of maximum degree D undergoes a phase transition that coincides with the uniqueness phase…
An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G-v$ to obtain the subtrees of $v$. The graph associahedron of $G$ is a…
The dilute A_3 model is a solvable IRF (interaction round a face) model with three local states and adjacency conditions encoded by the Dynkin diagram of the Lie algebra A_3. It can be regarded as a solvable version of an Ising model at the…
We prove a hardness of sampling result for the anti-ferromagnetic Ising model on random graphs of average degree $d$ for large constant $d$, proving that when the normalized inverse temperature satisfies $\beta>1$ (asymptotically…
Zeros of the $n$th moment of the partition function $[Z^n]$ are investigated in a vanishing temperature limit $\beta \to \infty$, $n \to 0$ keeping $y=\beta n \sim O(1)$. In this limit, the moment parameterized by $y$ characterizes the…
It is known that there is no EPTAS for the $m$-dimensional knapsack problem unless $W[1] = FPT$. It is true already for the case, when $m = 2$. But, an FPTAS still can exist for some other particular cases of the problem. In this note, we…
This is the second in a series of three articles about recovering the full algebraic structure of a boundary conformal field theory (CFT) from the scaling limit of the critical Ising model in slit-strip geometry. Here we study the fusion…
Transfer-matrix methods, with the help of finite-size scaling and conformal invariance concepts, are used to investigate the critical behavior of two-dimensional square-lattice Ising spin-1/2 systems with first- and second-neighbor…