相关论文: Ferromagnetic Potts Model: Refined #BIS-hardness a…
A periodic Ising model is one endowed with interactions that are invariant under translations of members of a full-rank sublattice $\mathfrak{L}$ of $\mathbb{Z}^2$. We give an exact, quantitative description of the critical temperature,…
The data-driven characterization of the ``complexity'' present in dynamical systems remains an open problem with broad applications across the physical sciences. We investigate the ``structural complexity'' of the 2D ferromagnetic Ising…
We develop an efficient algorithmic approach for approximate counting and sampling in the low-temperature regime of a broad class of statistical physics models on finite subsets of the lattice $\mathbb Z^d$ and on the torus $(\mathbb Z/n…
The d=1 Ising ferromagnet and spin glass with long-range power-law interactions J r^-a is studied for all interaction range exponents a by a renormalization-group transformation that simultaneously projects local ferromagnetism and…
A recent result has demonstrated that the Bethe partition function always lower bounds the true partition function of binary, log-supermodular graphical models. We demonstrate that these results can be extended to other interesting classes…
We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…
Given a graphical model (GM), computing its partition function is the most essential inference task, but it is computationally intractable in general. To address the issue, iterative approximation algorithms exploring certain local…
This paper resolves a common complexity issue in the Bethe approximation of statistical physics and the Belief Propagation (BP) algorithm of artificial intelligence. The Bethe approximation and the BP algorithm are heuristic methods for…
Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…
Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortest paths distance) and Radius (the smallest distance for which a "center" node can reach all other nodes). The natural and important…
The phase transitions at finite temperatures in the systems described by the Bose-Fermi-Hubbard model are investigated in this work in the framework of the selfconsistent random phase approximation. The case of the hard-core bosons is…
The complexity of classical computational problems in graph classes defined by forbidding induced subgraphs is one of the central topics of algorithmic graph theory. Recently, there has been a growing interest in the complexity of such…
We show a close connection between structural hardness for $k$-partite graphs and tight inapproximability results for scheduling problems with precedence constraints. Assuming a natural but nontrivial generalisation of the bipartite…
We establish tight results for rapid mixing of Gibbs samplers for the Ferromagnetic Ising model on general graphs. We show that if \[(d-1)\tanh\beta<1,\] then there exists a constant C such that the discrete time mixing time of Gibbs…
We consider Potts model hypersurfaces defined by the multivariate Tutte polynomial of graphs (Potts model partition function). We focus on the behavior of the number of points over finite fields for these hypersurfaces, in comparison with…
A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been…
We study the fixed-magnetization ferromagnetic Ising model on random $d$-regular graphs for $d\ge 3$ and inverse temperature below the tree reconstruction threshold. Our main result is that for each magnetization $\eta$, the free energy…
We revisit classical bounds of M. E. Fisher on the ferromagnetic Ising model, and show how to efficiently use them on an arbitrary given graph to rigorously upper-bound the partition function, magnetizations, and correlations. The results…
Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set…
We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time inapproximability of the maximum independent set problem, a question studied in the area of…