相关论文: Ferromagnetic Potts Model: Refined #BIS-hardness a…
We prove that the spectral gap of the Swendsen-Wang process for the Potts model on graphs with bounded degree is bounded from below by some constant times the spectral gap of any single-spin dynamics. This implies rapid mixing of the…
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…
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…
In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of $H$-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given that the problem remains $NP$-hard for most graphs $H$, we…
The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if…
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for…
We investigate the phase transition of the 3-coloring problem on random graphs, using the extremal optimization heuristic. 3-coloring is among the hardest combinatorial optimization problems and is closely related to a 3-state…
In the Weighted Triangle-Free 2-Matching problem (WTF2M), we are given an undirected edge-weighted graph. Our goal is to compute a maximum-weight subgraph that is a 2-matching (i.e., no node has degree more than $2$) and triangle-free…
We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…
We study the critical behavior of the random q-state Potts model in the large-q limit on the diamond hierarchical lattice with an effective dimensionality $d_{\rm eff} > 2$. By varying the temperature and the strength of the frustration the…
We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…
We study the phases of strongly correlated electron systems in two spatial dimensions in the framework of AdS${}_4$/CFT${}_3$ correspondence. The AdS (gravity) model consists of a Dirac fermion coupled to electromagnetic field and gravity.…
We consider the thermal phase transition from a paramagnetic to stripe-antiferromagnetic phase in the frustrated two-dimensional square-lattice Ising model with competing interactions J1<0 (nearest neighbor, ferromagnetic) and J2 >0 (second…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
We consider the task of detecting a hidden bipartite subgraph in a given random graph. This is formulated as a hypothesis testing problem, under the null hypothesis, the graph is a realization of an Erd\H{o}s-R\'{e}nyi random graph over $n$…
The fixed point structure of the 2D 3-state random-bond Potts model with a bimodal ($\pm$J) distribution of couplings is for the first time fully determined using numerical renormalization group techniques. Apart from the pure and T=0…
We establish the phase diagram of the disordered three-dimensional Bose-Hubbard model at unity filling, which has been controversial for many years. The theorem of inclusions, proven in Ref. [1], states that the Bose glass phase always…
Phase transitions are ubiquitous phenomena, exemplified by the melting of ice and spontaneous magnetization of magnetic material. In general, a phase transition is associated with a symmetry breaking of a system; occurs due to the…
In their breakthrough ICALP'15 paper, Bernstein and Stein presented an algorithm for maintaining a $(3/2+\epsilon)$-approximate maximum matching in fully dynamic {\em bipartite} graphs with a {\em worst-case} update time of…
Sampling Boltzmann probability distributions plays a key role in machine learning and optimization, motivating the design of hardware accelerators such as Ising machines. While the Ising model can in principle encode arbitrary optimization…