Related papers: The complexity of approximating the complex-valued…
We discuss the finite-size scaling of the ferromagnetic Ising model on random regular graphs. These graphs are locally tree-like, and in the limit of large graphs, the Bethe approximation gives the exact free energy per site. In the…
We study the worst-case mixing time of the global Kawasaki dynamics for the fixed-magnetization Ising model on the class of graphs of maximum degree $\Delta$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below…
We study the Ising model with an external magnetic field on random tetravalent planar maps and investigate its critical behavior. Explicit expressions for spontaneous magnetization and the susceptibility are computed and the critical…
Although the physical properties of the 2D and 1D Ising models are quite different, we point out an interesting connection between their complex-temperature phase diagrams. We carry out an exact determination of the complex-temperature…
For numerous graph problems in the realm of parameterized algorithms, using the size of a smallest deletion set (called a modulator) into well-understood graph families as parameterization has led to a long and successful line of research.…
Consider random $d$-regular graphs, i.e., random graphs such that there are exactly $d$ edges from each vertex for some $d\ge 3$. We study both the configuration model version of this graph, which has occasional multi-edges and self-loops,…
We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology…
A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite domain that interact through constraints that each bind a few…
There is no an exact solution to three-dimensional (3D) finite-size Ising model (referred to as the Ising model hereafter for simplicity) and even two-dimensional (2D) Ising model with non-zero external field to our knowledge. Here by using…
Employing the exact solution of Onsager for two-dimensional Ising models, simple expressions are proposed for computing the partition function, magnetization, specific heat and susceptibility for non-zero magnetic fields of square lattices.…
We propose in this paper a novel inverse tangent transverse shear deformation formulation for functionally graded material (FGM) plates. The isogeometric finite element analysis (IGA) of static, free vibration and buckling problems of FGM…
Exact computation of the partition function is known to be intractable, necessitating approximate inference techniques. Existing methods for approximate inference are slow to converge for many benchmarks. The control of accuracy-complexity…
We investigate the low-temperature critical behavior of the three dimensional random-field Ising ferromagnet. By a scaling analysis we find that in the limit of temperature $T \to 0$ the usual scaling relations have to be modified as far as…
Constraint Satisfaction Problem (CSP) is a framework for modeling and solving a variety of real-world problems. Once the problem is expressed as a finite set of constraints, the goal is to find the variables' values satisfying them. Even…
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…
By prior work, there is a distributed algorithm that finds a maximal fractional matching (maximal edge packing) in $O(\Delta)$ rounds, where $\Delta$ is the maximum degree of the graph. We show that this is optimal: there is no distributed…
We study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\lambda^{|I|}$, for a positive real parameter $\lambda$. For large $\lambda$, computing the partition…
We study the Independent Set (IS) problem in $H$-free graphs, i.e., graphs excluding some fixed graph $H$ as an induced subgraph. We prove several inapproximability results both for polynomial-time and parameterized algorithms.…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…